Two-commodity flow is equivalent to linear programming under nearly-linear time reductions (Q6560848)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7870264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-commodity flow is equivalent to linear programming under nearly-linear time reductions |
scientific article; zbMATH DE number 7870264 |
Statements
Two-commodity flow is equivalent to linear programming under nearly-linear time reductions (English)
0 references
24 June 2024
0 references
two-commodity flow problems
0 references
linear programming
0 references
fine-grained complexity
0 references
