Linear programming is log-space hard for P
- 15 February 1979
- journal article
- Published by Elsevier BV in Information Processing Letters
- Vol. 8 (2), 96-97
- https://doi.org/10.1016/0020-0190(79)90152-2
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Complete problems for deterministic polynomial timePublished by Association for Computing Machinery (ACM) ,1974