Pages that link to "Item:Q4749612"
From MaRDI portal
The following pages link to On the computational complexity of piecewise-linear homotopy algorithms (Q4749612):
Displaying 5 items.
- Exponential lower bounds for finding Brouwer fixed points (Q911230) (← links)
- Rudiments of an average case complexity theory for piecewise-linear path following algorithms (Q1111475) (← links)
- General equilibrium models and homotopy methods (Q1960548) (← links)
- Computational complexity of a piecewise linear homotopy algorithm (Q3321342) (← links)
- Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's (Q3657800) (← links)
