The complexity of linear problems in fields
Journal of Symbolic Computation
Complexity of deciding Tarski algebra
Journal of Symbolic Computation
Journal of Symbolic Computation
Finite-model theory—a personal perspective
ICDT Selected papers of the 4th international conference on Database theory
Finitely representable databases (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Dense-order constraint databases (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Queries with arithmetical constraints
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Uniform quantifier elimination and constraint query processing
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Languages for relational databases over interpreted structures
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational expressive power of constraint query languages
Journal of the ACM (JACM)
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of Database Systems
Principles of Database Systems
Constraint Programming and Database Query Languages
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
On the Structure of Queries in Constraint Query Languages
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On the Combinatorial and Topological Complexity of a Single Cell
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Geometric algorithms for trap design
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Relational queries over interpreted structures
Journal of the ACM (JACM)
Quantifier Rank for Parity of Embedded Finite Models
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Variable Independence, Quantifier Elimination, and Constraint Representations
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Variable independence for first-order definable constraints
ACM Transactions on Computational Logic (TOCL)
Limits of theory sequences over algebraically closed fields and applications
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
The complexity of quantitative concurrent parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Complexity of the resolution of parametric systems of polynomial equations and inequations
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
An incremental algorithm for DLO quantifier elimination via constraint propagation
Artificial Intelligence
Quantifier elimination for the reals with a predicate for the powers of two
Theoretical Computer Science
The complexity of quantifier elimination and cylindrical algebraic decomposition
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On metrics for probabilistic systems: Definitions and algorithms
Computers & Mathematics with Applications
Fast simplifications for Tarski formulas
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Out of order quantifier elimination for Standard Quantified Linear Programs
Journal of Symbolic Computation
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A logic for reasoning about evidence
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
The expressivity of constraint query languages with boolean algebra linear cardinality constraints
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Fast simplifications for Tarski formulas based on monomial inequalities
Journal of Symbolic Computation
Sensitivity analysis using type-based constraints
Proceedings of the 1st annual workshop on Functional programming concepts in domain-specific languages
Note: On the complexity of quantified linear systems
Theoretical Computer Science
Hi-index | 0.01 |
In this paper, we give a new algorithm for quantifier elimination in the first order theory of real closed fields that improves the complexity of the best known algorithm for this problem till now. Unlike previously known algorithms [Basu et al. 1996; Renegar 1992; Heintz et al. 1990], the combinatorial part of the complexity (the part depending on the number of polynomials in the input) of this new algorithm is independent of the number of free variables. Moreover, under the assumption that each polynomial in the input depends only on a constant number of the free variables, the algebraic part of the complexity(the part depending on the degrees of the input polynomials) can also be made independent of the number of free variables. This new feature of our algorithm allow us to obtain a new algorithm for a variant of the quantifier elimination problem. We give an almost optimal algorithm for this new problem, which we call the uniform quantifier elimination problem.Using tthe uniform quantifier elimination algorithm, we give an algorithm for solving a problem arising in the field of constraint databases with real polynomial constraints. We give an algorithm for converting a query with natural domain semantics to an equivalent one with active domain semantics. A nonconstructive version of this result was proved in Benedikt et al. [1998]. Very recently, a constructive proof was also given independently in Benedikt and Libkin [1997]. However, complexity issues were not considered and no algorithm with a reasonable complexity bound was known for this latter problem till now.We also point out interesting logical consequences of this algorithmic result, concerning the expressive power of a constraint query language over the reals. This leads to simpler and constructive proofs for these inexpressibility results than the ones known before.Moreover, our improved algorithm for performing quantifier elimination immediately leads to improved algorithms for several problems for which quantifier elimination is a basic step, for example, the problem of computing the closure of a given semi-algebraic set.