"Some lower bounds for the complexity of the linear programming feasibility ..."

Rafael Grimson, Bart Kuijpers (2009)

> Home

Details and statistics

DOI: 10.1016/J.JCO.2008.07.002

access: closed

type: Journal Article

metadata version: 2022-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jc/GrimsonK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jc/GrimsonK09
Rafael Grimson, Bart Kuijpers:
Some lower bounds for the complexity of the linear programming feasibility problem over the reals. J. Complex. 25(1): 25-37 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.