On the complexity of quadratic programming in real number models of computation
From MaRDI portal
Publication:1338219
DOI10.1016/0304-3975(94)00070-0zbMath0811.90082OpenAlexW2146275063MaRDI QIDQ1338219
Publication date: 27 November 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00070-0
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
On the complexity of quadratic programming in real number models of computation ⋮ A note on parallel and alternating time ⋮ On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic ⋮ Complexity aspects of a semi-infinite optimization problem† ⋮ Some aspects of studying an optimization or decision problem in different computational models ⋮ On the computational structure of the connected components of a hard problem ⋮ Generalized finite automata over real and complex numbers ⋮ Logics which capture complexity classes over the reals
Cites Work
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison
- Complexity of linear programming
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Test complexity of generic polynomials
- NC algorithms for real algebraic numbers
- Separation of complexity classes in Koiran's weak model
- On the complexity of quadratic programming in real number models of computation
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- On digital nondeterminism
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On Quadratic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the complexity of quadratic programming in real number models of computation
