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 elimination; ellipse problem; positive polynomial problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W30: Symbolic computation and algebraic computation

03D15: Complexity of computation (including implicit computational complexity)

03C10: Quantifier elimination, model completeness, and related topics

Related Items

Improved projection for cylindrical algebraic decomposition, Geometric reasoning with logic and algebra, Some lower bounds for the complexity of the linear programming feasibility problem over the reals, Iterated discriminants, On mechanical quantifier elimination for elementary algebra and geometry, A bibliography of quantifier elimination for real closed fields, Recent advances on determining the number of real roots of parametric polynomials, Real algebraic numbers and polynomial systems of small degree, Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander, Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact, Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping

Cites Work

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