Linear Programming with Two Variables Per Inequality in Poly-Log Time
- 1 December 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (6) , 1000-1010
- https://doi.org/10.1137/0219068
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Parallel Algorithms for Shared-Memory MachinesPublished by Elsevier ,1990
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Towards a Genuinely Polynomial Algorithm for Linear ProgrammingSIAM Journal on Computing, 1983
- The maximum flow problem is log space complete for PTheoretical Computer Science, 1982
- A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per InequalitySIAM Journal on Computing, 1980
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974