arXiv · 1609.02879
Elementary recursive quantifier elimination based on Thom encoding and sign determination
Abstract
We describe a new quantifier elimination algorithm for real closed fields based on Thom encoding and sign determination. The complexity of this algorithm is elementary recursive and its proof of correctness is completely algebraic. In particular, the notion of connected components of semialgebraic sets is not used.
Explore related subjects
Keep this discovery
Daniel Perrucci, Marie-Françoise Roy. 2016-09-09. Elementary recursive quantifier elimination based on Thom encoding and sign determination. https://arxiv.org/abs/1609.02879
Cite the original work for its findings. Save a collection to share your selection of sources.