Integer Arithmetic Algorithms for Polynomial Real Zero Determination
Journal of the ACM (JACM)
Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields
Proceedings of the Mathematical Foundations of Computer Science 1984
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Ein Entscheidungsverfahren für die Theorie der reell- abgeschlossenen Körper
Komplexität von Entscheidungsproblemen, Ein Seminar
The complexity of elementary algebra and geometry
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A bibliography of quantifier elimination for real closed fields
Journal of Symbolic Computation
The complexity of planar compliant motion planning under uncertainty
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
The complexity of deciding consistency of systems of polynomials in exponent inequalities
Journal of Symbolic Computation
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Quantifier elimination for formulas constrained by quadratic equations
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Separation for boundary to CSG conversion
ACM Transactions on Graphics (TOG)
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds on testing membership to a polyhedron by algebraic decision trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Uniform quantifier elimination and constraint query processing
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Computing local dimension of a semialgebraic set
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Journal of the ACM (JACM)
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
New complexity bounds for cylindrical decompositions of sub-pfaffian sets
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Improved projection for cylindrical algebraic decomposition
Journal of Symbolic Computation
Decidable verification for reducible timed automata specified in a first order logic with time
Theoretical Computer Science
Testing Positiveness of Polynomials
Journal of Automated Reasoning
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
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
3D Structural Homology Detection via Unassigned Residual Dipolar Couplings
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Computer algebra handbook
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An Algebraic Geometry Approach to Protein Structure Determination from NMR Data
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
Compositional information flow security for concurrent programs
Journal of Computer Security
Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
A numerical algorithm for zero counting, I: Complexity and accuracy
Journal of Complexity
Inclusion dynamics hybrid automata
Information and Computation
Discounted Properties of Probabilistic Pushdown Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Variant real quantifier elimination: algorithm and application
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Floodlight illumination of infinite wedges
Computational Geometry: Theory and Applications
Discrete Semantics for Hybrid Automata
Discrete Event Dynamic Systems
On information invariants in robotics
Artificial Intelligence
VPSPACE and a transfer theorem over the reals
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Theory-specific automated reasoning
A 25-year perspective on logic programming
Verification and synthesis using real quantifier elimination
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
On the markovian randomized strategy of controller for markov decision processes
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
On the controller synthesis for finite-state markov decision processes
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On the decidability of temporal properties of probabilistic pushdown automata
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
An efficient algorithm for the sign condition problem in the semi-algebraic context
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
Variant quantifier elimination
Journal of Symbolic Computation
The compass that steered robotics
Logic and Program Semantics
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
Analyzing probabilistic pushdown automata
Formal Methods in System Design
| Hi-index | 0.00 |
Let a formula of Tarski algebra contain k atomic subformulas of the kind (f"i = 0), 1 =