论文信息 - Quantifier Elimination for Real Closed Fields

Quantifier Elimination for Real Closed Fields

There exist still many possibilities to essentially reduce the computation time of quantifier elimination for the elementary real algebra. Two are pointed out a) in case of only a few quantified and arbitrary many free variables and b) in case of one or more quantifier blocks of length ≥ 2.

W. Böge | W. Böge

[1] John H. Reif,et al. The complexity of elementary algebra and geometry , 1984, STOC '84.

[2] George E. Collins,et al. An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-Dimensional Space , 1985, J. Symb. Comput..

[3] Dennis Soule Arnon. Algorithms for the geometry of semi-algebraic sets , 1981 .

[4] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .

[5] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[6] Chee-Keng Yap,et al. Algebraic cell decomposition in NC , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).