✦ LIBER ✦

The binary network flow problem is logspace complete for P

✍ Scribed by Thomas Lengauer; Klaus W. Wagner

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The isomorphism problem for k-trees is c

✍ V. Arvind; Bireswar Das; Johannes Köbler; Sebastian Kuhnert 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 295 KB

The maximum flow problem is log space co

✍ Leslie M. Goldschlager; Ralph A. Shaw; John Staples 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 732 KB