Quantifier elimination: Optimal solution for two classical examples

DOI10.1016/S0747-7171(88)80015-4zbMath0647.03023WikidataQ56224655 ScholiaQ56224655MaRDI QIDQ1104314

Daniel Lazard

Publication date: 1988

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

quantifier eliminationellipse problempositive polynomial problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Complexity of computation (including implicit computational complexity) (03D15) Quantifier elimination, model completeness, and related topics (03C10)

Related Items

Real algebraic numbers and polynomial systems of small degree ⋮ On mechanical quantifier elimination for elementary algebra and geometry ⋮ A bibliography of quantifier elimination for real closed fields ⋮ Versal unfolding of homogeneous cubic degenerate centers in strong monodromic family ⋮ Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander ⋮ Multiplicative noise removal with a sparsity-aware optimization model ⋮ Mathematical analysis of the multisolution phenomenon in the P3P problem ⋮ Grand unification and the Planck scale: an SO(10) example of radiative symmetry breaking ⋮ Geometric reasoning with logic and algebra ⋮ Singular solutions of a Lane-Emden system ⋮ Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact ⋮ Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping ⋮ Improved projection for cylindrical algebraic decomposition ⋮ Some lower bounds for the complexity of the linear programming feasibility problem over the reals ⋮ A Simple Quantifier-Free Formula of Positive Semidefinite Cyclic Ternary Quartic Forms ⋮ Optimization of the richardson integration over fluctuations of its step sizes ⋮ Multiplicative noise removal in imaging: an exp-model and its fixed-point proximity algorithm ⋮ Recent advances on determining the number of real roots of parametric polynomials ⋮ Iterated discriminants ⋮ Special algorithm for stability analysis of multistable biological regulatory systems ⋮ Further results on the distance and area control of planar formations

Cites Work

• A solution to Kahan's problem (SIGSAM problem no. 9)
• Unnamed Item
• Unnamed Item