Polynomial size linear programs for problems in P
- 1 July 2019
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 265, 22-39
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Ministry of Education, Culture, Sports, Science and Technology
This publication has 14 references indexed in Scilit:
- Compact linear programs for 2SATEuropean Journal of Combinatorics, 2019
- A generalization of extension complexity that captures PInformation Processing Letters, 2015
- On the extension complexity of combinatorial polytopesMathematical Programming, 2014
- A note on the extension complexity of the knapsack polytopeOperations Research Letters, 2013
- On the geometric interpretation of the nonnegative rankLinear Algebra and its Applications, 2012
- Approximation Limits of Linear Programs (Beyond Hierarchies)2012
- Geometric Algorithms and Combinatorial Optimization1993
- Expressing combinatorial optimization problems by Linear ProgramsJournal of Computer and System Sciences, 1991
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- Time bounded random access machinesJournal of Computer and System Sciences, 1973