Some lower bounds for the complexity of the linear programming feasibility problem over the reals.
Rafael GrimsonBart KuijpersPublished in: J. Complex. (2009)
Keyphrases
- lower bound
- linear programming
- objective function
- worst case
- np hard
- upper bound
- linear program
- branch and bound algorithm
- optimal solution
- linear programming relaxation
- complexity measures
- constraint databases
- dynamic programming
- concept class
- branch and bound
- average case complexity
- vc dimension
- computational complexity
- primal dual
- upper and lower bounds
- quadratic programming
- space complexity
- decision problems
- search space
- data structure