Quantifier elimination: Optimal solution for two classical examples

Authors:
Daniel Lazard
Affiliations:
L.I.T.P. Université Paris VI, Tour 55-65, 4 place Jussieu, 75252 Paris Cedex 05, France
Venue:
Journal of Symbolic Computation
Year:
1988

Citing 3
Cited 17

Towards mechanical solution of the Kahan Ellipse Problem 1

EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
A solution to Kahan's problem (SIGSAM problem no. 9)

ACM SIGSAM Bulletin
Problem #9: an ellipse problem

ACM SIGSAM Bulletin

On mechanical quantifier elimination for elementary algebra and geometry

Journal of Symbolic Computation
A bibliography of quantifier elimination for real closed fields

Journal of Symbolic Computation
Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Quantifier elimination for real algebra—the cubic case

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Local quantifier elimination

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Improved projection for cylindrical algebraic decomposition

Journal of Symbolic Computation
A generic projection operator for partial cylindrical algebraic decomposition

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Efficient projection orders for CAD

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Computing the global optimum of a multivariate polynomial over the reals

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact

Computer Mathematics
Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping

Computer Mathematics
Real algebraic numbers and polynomial systems of small degree

Theoretical Computer Science
Some lower bounds for the complexity of the linear programming feasibility problem over the reals

Journal of Complexity
Iterated discriminants

Journal of Symbolic Computation
An algorithm for computing the complete root classification of a parametric polynomial

AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Quantifier elimination for quartics

AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Optimising problem formulation for cylindrical algebraic decomposition

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimal solutions are given for the two following problems: the condition for a degree 4 polynomial to have only positive values and the condition for an ellipse to be inside the unit circle.