Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard (Q1806034)
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: Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard |
scientific article; zbMATH DE number 1356217
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard |
scientific article; zbMATH DE number 1356217 |
Statements
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard (English)
0 references
10 February 2004
0 references
primal-dual of linear programming
0 references
computational complexity
0 references
complexity measure
0 references
primal-dual interior-point algorithm
0 references
