An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
DOI10.1016/S0022-4049(97)00068-6zbMATH Open0929.68132MaRDI QIDQ1295548FDOQ1295548
Authors: Susana Puddu, Juan Sabia 
Publication date: 16 August 1999
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3895043
- Definability and fast quantifier elimination in algebraically closed fields
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
- On the combinatorial and algebraic complexity of quantifier elimination
- New results on quantifier elimination over real closed fields and applications to constraint databases
Symbolic computation and algebraic computation (68W30) Model-theoretic algebra (03C60) Quantifier elimination, model completeness, and related topics (03C10) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)
Cites Work
- Title not available (Why is that?)
- Straight-line programs in geometric elimination theory
- On computing the determinant in small parallel time using a small number of processors
- On the efficiency of effective Nullstellensätze
- Berechnung und Programm. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- ESTIMATES FOR THE ORDERS OF ZEROS OF FUNCTIONS OF A CERTAIN CLASS AND APPLICATIONS IN THE THEORY OF TRANSCENDENTAL NUMBERS
- Sharp Effective Nullstellensatz
- Definability and fast quantifier elimination in algebraically closed fields
- Title not available (Why is that?)
- Effective Bezout identities in \({\mathbb{Q}}[z_ 1,\dots ,z_ n]\)
- Fast parallel matrix and GCD computations
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Title not available (Why is that?)
- On Relating Time and Space to Size and Depth
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Greatest common divisors of polynomials given by straight-line programs
- Title not available (Why is that?)
- Bounds for the degrees in the Nullstellensatz
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the representation of rational functions of bounded complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
- How to compute the Chow form of an unmixed polynomial ideal in single exponential time
- Title not available (Why is that?)
Cited In (13)
- A new method to obtain lower bounds for polynomial evaluation
- Polynomial bounds for invariant functions separating orbits
- Definability and fast quantifier elimination in algebraically closed fields
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
- Applying Linear Quantifier Elimination
- Title not available (Why is that?)
- Elimination for generic sparse polynomial systems
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
- Computing bases of complete intersection rings in Noether position
- Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants
- A Quantifier Elimination Algorithm for Linear Real Arithmetic
- Weak identifiability for differential algebraic systems
- On the number of sets definable by polynomials
This page was built for publication: An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295548)
