Pages that link to "Item:Q4027865"
From MaRDI portal
The following pages link to On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae (Q4027865):
Displayed 8 items.
- Computation of equilibria in noncooperative games (Q815274) (← links)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
- 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 (Q1185456) (← links)
- Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints (Q1921395) (← links)
- Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← links)
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity (Q5198048) (← links)
- An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5743610) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)