The maximum flow problem is log space complete for P
- 31 October 1982
- journal article
- research article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 21 (1), 105-111
- https://doi.org/10.1016/0304-3975(82)90092-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- ?-productions in context-free grammarsActa Informatica, 1981
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Hierarchies of complete problemsActa Informatica, 1976
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974