论文信息 - The Maximum Flow Problem is Log Space Complete for P - 字舞流文

The Maximum Flow Problem is Log Space Complete for P

John Staples | Leslie M. Goldschlager | Ralph A. Shaw | L. Goldschlager | Ralph A. Shaw | J. Staples

[1] Shimon Even,et al. Graph Algorithms , 1979 .

[2] Richard J. Lipton,et al. Linear Programming is Log-Space Hard for P , 1979, Inf. Process. Lett..

[3] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[4] Leslie M. Goldschlager,et al. A unified approach to models of synchronous parallel machines , 1978, STOC.

[5] L. Goldschlager. The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[6] Dexter Kozen,et al. Complexity of finitely presented algebras , 1977, STOC '77.

[7] Zvi Galil,et al. Hierarchies of complete problems , 1976, Acta Informatica.

[8] R. Ladner. The circuit value problem is log space complete for P , 1975, SIGA.

[9] I-Ngo Chen,et al. A New Parallel Algorithm for Network Flow Problems , 1974, Sagamore Computer Conference.

[10] Neil D. Jones,et al. Complete problems for deterministic polynomial time , 1974, STOC '74.

[11] Stephen A. Cook,et al. An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..