An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
From MaRDI portal
Publication:1295548
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
Cites work
- scientific article; zbMATH DE number 4210304 (Why is no real title available?)
- scientific article; zbMATH DE number 4152532 (Why is no real title available?)
- scientific article; zbMATH DE number 3917710 (Why is no real title available?)
- scientific article; zbMATH DE number 3959582 (Why is no real title available?)
- scientific article; zbMATH DE number 4112009 (Why is no real title available?)
- scientific article; zbMATH DE number 3723860 (Why is no real title available?)
- scientific article; zbMATH DE number 3759547 (Why is no real title available?)
- scientific article; zbMATH DE number 3564960 (Why is no real title available?)
- scientific article; zbMATH DE number 4123298 (Why is no real title available?)
- scientific article; zbMATH DE number 4123858 (Why is no real title available?)
- scientific article; zbMATH DE number 939812 (Why is no real title available?)
- scientific article; zbMATH DE number 3999284 (Why is no real title available?)
- scientific article; zbMATH DE number 806915 (Why is no real title available?)
- scientific article; zbMATH DE number 865572 (Why is no real title available?)
- scientific article; zbMATH DE number 3895043 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Berechnung und Programm. I
- Bounds for the degrees in the Nullstellensatz
- Definability and fast quantifier elimination in algebraically closed fields
- ESTIMATES FOR THE ORDERS OF ZEROS OF FUNCTIONS OF A CERTAIN CLASS AND APPLICATIONS IN THE THEORY OF TRANSCENDENTAL NUMBERS
- Effective Bezout identities in \({\mathbb{Q}}[z_ 1,\dots ,z_ n]\)
- Fast parallel matrix and GCD computations
- Greatest common divisors of polynomials given by straight-line programs
- How to compute the Chow form of an unmixed polynomial ideal in single exponential time
- On Relating Time and Space to Size and Depth
- On computing the determinant in small parallel time using a small number of processors
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- On the efficiency of effective Nullstellensätze
- On the representation of rational functions of bounded complexity
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
- Sharp Effective Nullstellensatz
- Straight-line programs in geometric elimination theory
- THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS
Cited in
(15)- Elimination for generic sparse polynomial systems
- Definability and fast quantifier elimination in algebraically closed fields
- Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
- Computing bases of complete intersection rings in Noether position
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
- A new method to obtain lower bounds for polynomial evaluation
- scientific article; zbMATH DE number 1684364 (Why is no real title available?)
- Applying Linear Quantifier Elimination
- Straight-line programs in geometric elimination theory
- On the number of sets definable by polynomials
- Polynomial bounds for invariant functions separating orbits
- Towards fast one-block quantifier elimination through generalised critical values
- Weak identifiability for differential algebraic systems
- A Quantifier Elimination Algorithm for Linear Real Arithmetic
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)
