Quantifier elimination for real closed fields by cylindrical algebraic decomposition--preliminary report

Authors:
George E. Collins
Affiliations:
University of Wisconsin
Venue:
ACM SIGSAM Bulletin
Year:
1974

Citing 8
Cited 8

Subresultants and Reduced Polynomial Remainder Sequences

Journal of the ACM (JACM)
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Journal of the ACM (JACM)
On Euclid's Algorithm and the Theory of Subresultants

Journal of the ACM (JACM)
The Calculation of Multivariate Polynomial Resultants

Journal of the ACM (JACM)
Integer Arithmetic Algorithms for Polynomial Real Zero Determination

Journal of the ACM (JACM)
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC

SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
Algorithms for polynomial factorization.

Algorithms for polynomial factorization.
Algorithms for polynomials over a real algebraic number field.

Algorithms for polynomials over a real algebraic number field.

Factor refinement

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Using basis computation to determine pseudo-multiplicative independence

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Simplification of radical expressions

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Factoring into coprimes in essentially linear time

Journal of Algorithms
A branch and prune algorithm for the approximation of non-linear AE-solution sets

Proceedings of the 2006 ACM symposium on Applied computing
Interactive computer algebra software for teaching and helping students to study foundations of computer science

Journal of Computing Sciences in Colleges
An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination

Proceedings of the 2009 conference on Symbolic numeric computation
Verification and synthesis using real quantifier elimination

Proceedings of the 36th international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tarski in 1948, [18] published a quantifier elimination method for the elementary theory of real closed fields (which he had discovered in 1930). As noted by Tarski, any quantifier elimination method for this theory also provides a decision method, which enables one to decide whether any sentence of the theory is true or false. Since many important and difficult mathematical problems can be expressed in this theory, any computationally feasible quantifier elimination algorithm would be of utmost significance.