zbMATH — the first resource for mathematics

Linear programming is log-space hard for P. (English) Zbl 0402.68042

68Q25 Analysis of algorithms and problem complexity
90C05 Linear programming
PDF BibTeX Cite
Full Text: DOI
[1] D. Johnson and F. Preparata, private communication.
[2] Jones, N.; Laaser, W., Complete problems for deterministic polynomial time, Proc. sixth ann. ACM symp. theory of computing, 40-46, (1974)
[3] S. Reiss and D. Dobkin, The Complexity of Linear Programming. To appear. · Zbl 0446.90049
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.