The binary network flow problem is logspace complete for P (Q914388)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The binary network flow problem is logspace complete for P |
scientific article; zbMATH DE number 4149562
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The binary network flow problem is logspace complete for P |
scientific article; zbMATH DE number 4149562 |
Statements
The binary network flow problem is logspace complete for P (English)
0 references
1990
0 references
logspace complete
0 references
maximum flow
0 references
0.8386099
0 references
0.83689076
0 references
0.8348475
0 references
0.83320606
0 references
0.83124113
0 references
0 references
0.82665956
0 references
0.8254856
0 references
0.82245785
0 references
