Towards fast one-block quantifier elimination through generalised critical values - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Communications in Computer Algebra Année : 2021

Towards fast one-block quantifier elimination through generalised critical values

Jérémy Berthomieu
Andrew Ferguson
  • Fonction : Auteur
  • PersonId : 1076496
Mohab Safey El Din

Résumé

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.
Fichier principal
Vignette du fichier
abstract.pdf (358.33 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02929626 , version 1 (09-09-2020)

Identifiants

Citer

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, In press, 54 (3), pp.109-113. ⟨10.1145/3457341.3457348⟩. ⟨hal-02929626⟩
290 Consultations
262 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More