On the combinatorial and algebraic complexity of quantifier elimination (original) (raw)
Related papers
Journal of Pure and Applied Algebra, 1990
The complexity of quantifier elimination and cylindrical algebraic decomposition
2007
Quantifier elimination on real closed fields and differential equations
Algebra, Logic, Set Theory–Festschrift für Ulrich …
Real quantifier elimination is doubly exponential
Journal of Symbolic Computation, 1988
Real Quantifier Elimination in the RegularChains Library
Lecture Notes in Computer Science, 2014
Definability and fast quantifier elimination in algebraically closed fields
Theoretical Computer Science, 1983
Electronic Notes in Theoretical Computer Science, 2006
The quantifier complexity of polynomial-size iterated definitions in first-order logic
Mathematical Logic Quarterly, 2010
Improved algorithms for sign determination and existential quantifier elimination
1993
Two algorithms to decide Quantifier-free Definability in Finite Algebraic Structures
arXiv (Cornell University), 2023
Fast Quantifier Elimination Means P = NP
2006
A Quantifier Elimination Algorithm in a FOL with Equality
1991
Quantifier elimination by cylindrical algebraic decomposition based on regular chains
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation - ISSAC '14, 2014
Noneffective Quantifier Elimination
Mathematical Logic Quarterly, 2001
The Hardness of Polynomial Equation Solving
Foundations of Computational Mathematics, 2003
2005
I-RiSC: an SMT-compliant solver for the existential fragment of real algebra
Algebraic Informatics, 2011
On the Number of Quantifiers as a Complexity Measure
arXiv (Cornell University), 2022
On the intrinsic complexity of elimination problems in effective algebraic geometry
Contemporary Mathematics, 2013
A Solver for Quantied Formula Problem Q-ALL SAT
2008
Complexity results for quantified boolean formulae based on complete propositional languages
Florian Letombe, Pierre Marquis
2006
Deciding Quantifier-free Definability in Finite Algebraic Structures
Electronic Notes in Theoretical Computer Science, 2020
A Survey on the Complexity of Solving Algebraic Systems
International Mathematical Forum, 2010
The Complexity of Problems for Quantified Constraints
Theory of Computing Systems / Mathematical Systems Theory, 2007
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Theoretical Computer Science, 2010
On complexity reduction of Σ 1 formulas
Archive for Mathematical Logic, 2003