Pages that link to "Item:Q1806034"
From MaRDI portal
The following pages link to Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard (Q1806034):
Displaying 6 items.
- A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms (Q930345) (← links)
- On the complexity of approximating extremal determinants in matrices (Q1346597) (← links)
- On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
- Extreme points of well-posed polytopes (Q3446581) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- On circuit diameter bounds via circuit imbalances (Q6589764) (← links)