On the complexity of quadratic programming in real number models of computation
type: Item
instance of: scholarly article
title: On the complexity of quadratic programming in real number models of computation
zbMATH Open document ID: 0811.90082
DOI: 10.1016/0304-3975(94)00070-0
published in: Theoretical Computer Science
publication date: 1994-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 695894
zbMATH Keywords: linearly constrained (nonconvex) quadratic programming
author: Klaus Meer
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)00070-0
OpenAlex ID: W2146275063
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Test complexity of generic polynomials
cites work: Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
cites work: NC algorithms for real algebraic numbers
cites work: On digital nondeterminism
cites work: Separation of complexity classes in Koiran's weak model
cites work: On Quadratic Programming
cites work: Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison
cites work: Towards a Genuinely Polynomial Algorithm for Linear Programming
cites work: Q4011259
cites work: Q1185456
cites work: Q3818127
cites work: Q4279722
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: Complexity of linear programming
cites work: Q4279211
Recommended article: On the Complexity of Quantified Integer Programming
Recommended article: ON GENERIC COMPLEXITY OF THE QUADRATIC RESIDUOSITY PROBLEM
Recommended article: Complexity of integer quasiconvex polynomial optimization
Recommended article: On the complexity of quadratic programming with two quadratic constraints
Recommended article: On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
Recommended article: The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem
Recommended article: On the complexity of solving quadratic Boolean systems
Recommended article: Complexity of computation on real algebraic numbers
Recommended article: On the complexity of quasiconvex integer minimization problem
Recommended article: The Complexity of Solving Polynomial Equations by Quadrature
description: scientific article; zbMATH DE number 695894