On computing the determinant in small parallel time using a small number of processors
Information Processing Letters
The complexity of elementary algebra and geometry
Journal of Computer and System Sciences
Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Complexity of deciding Tarski algebra
Journal of Symbolic Computation
Journal of Symbolic Computation
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Complexity of computation on real algebraic numbers
Journal of Symbolic Computation
Mathematics for computer algebra
Mathematics for computer algebra
Algorithmic algebra
Counting connected components of a semialgebraic set in subexponential time
Computational Complexity
Computing a set of points meeting every cell defined by a family of polynomials on a variety
WAFR Proceedings of the workshop on Algorithmic foundations of robotics
Finding irreducible components of some real transcendental varieties
Computational Complexity
Zeros, multiplicities, and idempotents for zero-dimensional systems
Algorithms in algebraic geometry and applications
A computational method for diophantine approximation
Algorithms in algebraic geometry and applications
An Improved Sign Determination Algorithm
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Computing the complexification of a semi-algebraic set
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Computing roadmaps of semi-algebraic sets (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Uniform quantifier elimination and constraint query processing
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On the complexity of diophantine geometry in low dimensions (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Stretchability of star-like pseudo-visibility graphs
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Journal of the ACM (JACM)
Clustering for edge-cost minimization (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Different bounds on the different Betti numbers of semi-algebraic sets
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
New complexity bounds for cylindrical decompositions of sub-pfaffian sets
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Transfer theorems via sign conditions
Information Processing Letters
Real computations with fake numbers
Journal of Complexity
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
Real Computations with Fake Numbers
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Reach Set Computations Using Real Quantifier Elimination
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
Real solving for positive dimensional systems
Journal of Symbolic Computation
Towards faster real algebraic numbers
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
3D Structural Homology Detection via Unassigned Residual Dipolar Couplings
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Computer algebra handbook
Towards faster real algebraic numbers
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Computing the first Betti number and the connected components of semi-algebraic sets
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Generalized polar varieties: geometry and algorithms
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Complexity of the resolution of parametric systems of polynomial equations and inequations
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Guarding galleries and terrains
Information Processing Letters
The complexity of quantifier elimination and cylindrical algebraic decomposition
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Recurrence with affine level mappings is p-time decidable for clp$({\mathbb r})$
Theory and Practice of Logic Programming
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing the global optimum of a multivariate polynomial over the reals
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Inclusion dynamics hybrid automata
Information and Computation
Variant real quantifier elimination: algorithm and application
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Coalitional bargaining with agent type uncertainty
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Discrete Semantics for Hybrid Automata
Discrete Event Dynamic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Generalized polar varieties: geometry and algorithms
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Quantum automata and algebraic groups
Journal of Symbolic Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Approximating a behavioural pseudometric without discount for probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
The continuous Skolem-Pisot problem
Theoretical Computer Science
Journal of the ACM (JACM)
Supporting global numerical optimization of rational functions by generic symbolic convexity tests
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
The computational complexity of trembling hand perfection and other equilibrium refinements
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
The set of realizations of a max-plus linear sequence is semi-polyhedral
Journal of Computer and System Sciences
Quasi-interpretations a way to control resources
Theoretical Computer Science
Verification and synthesis using real quantifier elimination
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Computational complexity of the quantum separability problem
Quantum Information & Computation
On the generation of positivstellensatz witnesses in degenerate cases
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions
SIAM Journal on Optimization
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
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Recursive markov decision processes and recursive stochastic games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the approximation of interval functions
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithmic verification of recursive probabilistic state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An algebraic approach for the unsatisfiability of nonlinear constraints
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Verifying probabilistic procedural programs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Analysis of recursive probabilistic models
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Variant quantifier elimination
Journal of Symbolic Computation
Computing a nonnegative matrix factorization -- provably
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
Critical points and Gröbner bases: the unmixed case
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Critical point methods and effective real algebraic geometry: new results and trends
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Computing rational solutions of linear matrix inequalities
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Verified error bounds for real solutions of positive-dimensional polynomial systems
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Numerically Computing Real Points on Algebraic Sets
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
Note: On the complexity of quantified linear systems
Theoretical Computer Science
| Hi-index | 0.01 |
In this paper, a new algorithm for performing quantifier elimination from first order formulas over real closed fields in given. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this data. A new feature of this algorithm is that the role of the algebraic part (the dependence on the degrees of the imput polynomials) and the combinatorial part (the dependence on the number of polynomials) are sparated. Another new feature is that the degrees of the polynomials in the equivalent quantifier-free formula that is output, are independent of the number of input polynomials. As special cases of this algorithm new and improved algorithms for deciding a sentence in the first order theory over real closed fields, and also for solving the existential problem in the first order theory over real closed fields, are obtained.