Skip to Main content Skip to Navigation
Journal articles

Towards fast one-block quantifier elimination through generalised critical values

Abstract : One-block quantifier elimination is comprised of computing a semi-algebraic description of the projection of a semi-algebraic set or of deciding the truth of a semi-algebraic formula with a single quantifier. Until now, it has been tackled in practice by using variants and improvements of the Cylindrical Algebraic Decomposition (CAD) algorithm. For example, see the software packages QEPCAD, RegularChains or the system Mathematica. This algorithmic framework suffers from a complexity that is doubly exponential in the dimension of the ambient space. However, it has been shown that one-block quantifier elimination can be performed within a complexity that is singly exponential in that dimension.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Andrew Ferguson Connect in order to contact the contributor
Submitted on : Wednesday, September 9, 2020 - 10:40:45 AM
Last modification on : Friday, September 16, 2022 - 3:56:31 PM
Long-term archiving on: : Friday, December 4, 2020 - 5:23:08 PM


Files produced by the author(s)



Jérémy Berthomieu, Andrew Ferguson, Mohab Safey El Din. Towards fast one-block quantifier elimination through generalised critical values. ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), In press, 54 (3), pp.109-113. ⟨10.1145/3457341.3457348⟩. ⟨hal-02929626⟩



Record views


Files downloads