The maximum flow problem is log space complete for P
type: Item
instance of: scholarly article
title: The maximum flow problem is log space complete for P
zbMATH Open document ID: 0486.68035
DOI: 10.1016/0304-3975(82)90092-5
author: Leslie M. Goldschlager
author: Ralph A. Shaw
author: John Staples
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 3765135
zbMATH Keywords: space complexity
zbMATH Keywords: deterministic polynomial time
MaRDI profile type: Publication
full work available at URL: 0304-3975(82)90092-5
OpenAlex ID: W2059378738
cites work: An observation on time-storage trade off
cites work: Linear programming is log-space hard for P
cites work: Q3883524
cites work: Hierarchies of complete problems
cites work: A unified approach to models of synchronous parallel machines
cites work: Q4128417
cites work: \(\varepsilon\)-productions in context-free grammars
cites work: Q5592246
cites work: Complete problems for deterministic polynomial time
description: scientific article; zbMATH DE number 3765135