On the complexity of quadratic programming in real number models of computation
- 10 October 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 133 (1) , 85-94
- https://doi.org/10.1016/0304-3975(94)00070-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Separation of complexity classes in Koiran's weak modelTheoretical Computer Science, 1994
- Test complexity of generic polynomialsJournal of Complexity, 1992
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- Computations over Z and R: A comparisonJournal of Complexity, 1990
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic setsJournal of Symbolic Computation, 1988
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear ProgramsOperations Research, 1986
- Towards a Genuinely Polynomial Algorithm for Linear ProgrammingSIAM Journal on Computing, 1983
- Complexity of linear programmingOperations Research Letters, 1982
- On Quadratic ProgrammingManagement Science, 1971