On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
From MaRDI portal
Publication:4027865
DOI10.1137/0221060zbMath0768.65022MaRDI QIDQ4027865
Publication date: 9 March 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/8742
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
65H05: Numerical computation of solutions to single equations
65Y20: Complexity and performance of numerical algorithms
Related Items
An Almost Optimal Algorithm for Computing Nonnegative Rank, Computation of equilibria in noncooperative games, FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension, 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, Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints