On the space complexity of linear programming with preprocessing (Q2800577)
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: On the space complexity of linear programming with preprocessing |
scientific article; zbMATH DE number 6569708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the space complexity of linear programming with preprocessing |
scientific article; zbMATH DE number 6569708 |
Statements
15 April 2016
0 references
linear programming
0 references
P-completeness
0 references
preprocessing
0 references
space complexity
0 references
On the space complexity of linear programming with preprocessing (English)
0 references
0.843734622001648
0 references
0.7779430747032166
0 references
0.7777990102767944
0 references
0.7672054767608643
0 references
