On the complexity of quadratic programming in real number models of computation (Q1338219): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(94)00070-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2146275063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test complexity of generic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC algorithms for real algebraic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On digital nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of complexity classes in Koiran's weak model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of quadratic programming in real number models of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Genuinely Polynomial Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279211 / rank
 
Normal rank

Latest revision as of 09:35, 23 May 2024

scientific article
Language Label Description Also known as
English
On the complexity of quadratic programming in real number models of computation
scientific article

    Statements

    On the complexity of quadratic programming in real number models of computation (English)
    0 references
    27 November 1994
    0 references
    linearly constrained (nonconvex) quadratic programming
    0 references
    0 references

    Identifiers