The binary network flow problem is logspace complete for P (Q914388): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Constant Depth Reducibility / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4128417 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum flow problem is log space complete for P / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3759947 / rank | |||
Normal rank | |||
Latest revision as of 16:45, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The binary network flow problem is logspace complete for P |
scientific article |
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
