The following pages link to Complexity of linear programming (Q1165154):
Displaying 17 items.
- Probabilistic analysis of a differential equation for linear programming (Q652446) (← links)
- On average complexity of global optimization problems (Q687095) (← links)
- Open questions in complexity theory for numerical optimization (Q687097) (← links)
- Information-based complexity: New questions for mathematicians (Q751814) (← links)
- Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison (Q923632) (← links)
- Open problems in computational linear algebra (Q999481) (← links)
- A survey of information-based complexity (Q1080661) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- Polynomial algorithms for linear programming over the algebraic numbers (Q1343466) (← links)
- Mathematical problems for the next century (Q1582494) (← links)
- The ellipsoid method and its implications (Q1835842) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- Complexity of approximation problems (Q1962273) (← links)
- On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)
- On the average number of steps of the simplex method of linear programming (Q3040925) (← links)
- Application of the ellipsoid method in an interactive procedure for multicriteria linear programming (Q3328300) (← links)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768) (← links)
