2021/03/31 by Huu Phuoc Le, Mohab Safey El Din
Computer Science · Mathematics · #Algebra over a field #Algebraic number #Alternation (linguistics) #Block (permutation group theory) #Commutative Algebra and Its Applications #Numerical Methods and Algorithms #Polynomial #Polynomial and algebraic computation #Quantifier (linguistics) #Quantifier elimination #cs.CG #cs.SC
paper · pdf · doi:10.1145/3452143.3465546
International Symposium on Symbolic and Algebraic Computation 2021, Jul. 2021, Saint-Petersbourg, Russia
openalex created_date 2021/03/29 · arxiv created 2021/05/24 · arxiv updated 2021/05/25 · openalex publication_date 2021/07/13 · openalex updated_date 2026/08/06
Quantifier elimination over the reals is a central problem in computational real algebraic geometry, polynomial system solving and symbolic computation. Given a semi-algebraic formula (whose atoms are polynomial constraints) with quantifiers on some variables, it consists in computing a logically equivalent formula involving only unquantified variables. When there is no alternation of quantifiers, one has a one block quantifier elimination problem.