A note on approximate linear programming
References (2)
Approximating linear programming is log-space complete for P
Inform. Process. Lett.
(1991)Theory of Linear and Integer Programming
(1986)
Cited by (10)
Packing LPs are hard to solve accurately, assuming linear equations are hard
2020, Proceedings of the Annual ACM-SIAM Symposium on Discrete AlgorithmsInvariants of quantum programs: Characterisations and generation
2017, ACM SIGPLAN NoticesInvariants of quantum programs: Characterisations and generation
2017, Conference Record of the Annual ACM Symposium on Principles of Programming LanguagesParallel Approximation of Min-Max Problems
2013, Computational ComplexityParallel approximation of min-max problems with applications to classical and quantum zero-sum games
2012, Proceedings of the Annual IEEE Conference on Computational ComplexityQIP = PSPACE
2011, Journal of the ACM
- ∗
Supported in part by ONR Contract N00014-91-C0026.
Copyright © 1992 Published by Elsevier B.V.