Real quantifier elimination is doubly exponential

1988/02/01 by James H. Davenport, Joos Heintz · 12 citations
Computer Science · Mathematics · #Algebraic number #Coding theory and cryptography #Combinatorics #Digital Filter Design and Implementation #Discrete mathematics #Exponential function #Exponential growth #Mathematical analysis #Mathematics #Polynomial and algebraic computation #Pure mathematics #Quantifier (linguistics) #Quantifier elimination #Sequence (biology) #Space (punctuation) #Upper and lower bounds

paper · doi:10.1016/s0747-7171(88)80004-x

crossref issued 1988/02/01 · crossref published 1988/02/01 · crossref published-print 1988/02/01 · openalex publication_date 1988/02/01 · crossref created 2008/04/11 · crossref deposited 2018/12/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06 · crossref indexed 2026/08/06

Citations

• Definability and fast quantifier elimination in algebraically closed fields

Cited by

• Pseudo-Complex Quantifier Elimination
• Solving parametric polynomial systems using Generic Rational Univariate Representation
• A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications
• Faster One Block Quantifier Elimination for Regular Polynomial Systems of Equations
• First-Order Tests for Toricity
• A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks
• SMT and Functional Equation Solving over the Reals: Challenges from the IMO
• Verified Runtime Validation for Partially Observable Hybrid Systems
• Cylindrical Algebraic Sub-Decompositions
• Exact DC Representation of Multi-Tier Offloading Product in SAGINs via Quantifier Elimination
• Parametric Root Finding for Supporting Proving and Discovering Geometric Inequalities in GeoGebra
• Real closed field [wikipedia]