Cubegrades: Generalizing Association Rules
Data Mining and Knowledge Discovery
Large a polynomial-time nuclear vector replacement algorithm for automated NMR resonance assignments
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
3D Structural Homology Detection via Unassigned Residual Dipolar Couplings
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Inclusion dynamics hybrid automata
Information and Computation
Hybrid Automata in Systems Biology: How Far Can We Go?
Electronic Notes in Theoretical Computer Science (ENTCS)
Discrete Semantics for Hybrid Automata
Discrete Event Dynamic Systems
From synchronous programs to symbolic representations of hybrid systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Hybrid automata, reachability, and Systems Biology
Theoretical Computer Science
| Hi-index | 0.00 |
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 the combinatorial part of the complexity of this new algorithm is independent of the number of free variables. Moreover, under the assumption that each polynomial in the input depend only on a constant number of the free variables, the algebraic part of the complexity can also be made independent of the number of free variables. This new feature of our algorithm allows 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 and apply it to solve a problem arising in the field of constraint databases. No algorithm with 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. 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.