Faster one block quantifier elimination for regular polynomial systems of equations
From MaRDI portal
Cites work
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- A new approach for automatic theorem proving in real geometry
- A new decision method for elementary algebra
- Algebraic degree of polynomial optimization
- Algorithms in real algebraic geometry
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
- Applying Quantifier Elimination to Stability Analysis of Difference Schemes
- Artificial Intelligence and Symbolic Computation
- Basic algebraic geometry 1. Varieties in projective space. Translated from the Russian by Miles Reid
- Complexity of deciding Tarski algebra
- Comprehensive Gröbner bases
- Cylindrical algebraic decomposition using validated numerics
- Efficient Preprocessing Methods for Quantifier Elimination
- Extrait d'une lettre de Mr. Ch. Hermite de Paris à Mr. Borchardt de Berlin sur le nombre des racines d'une équation algébrique comprises entre des limites données.
- FGb: A Library for Computing Gröbner Bases
- scientific article; zbMATH DE number 421661 (Why is no real title available?)
- scientific article; zbMATH DE number 1189070 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1157666 (Why is no real title available?)
- scientific article; zbMATH DE number 1794361 (Why is no real title available?)
- scientific article; zbMATH DE number 2151204 (Why is no real title available?)
- scientific article; zbMATH DE number 2151206 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Improved projection for cylindrical algebraic decomposition
- On the combinatorial and algebraic complexity of quantifier elimination
- On the complexity of computing critical points with Gröbner bases
- On the complexity of the \(F_5\) Gröbner basis algorithm
- On the complexity of the generalized MinRank problem
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Partial cylindrical algebraic decomposition for quantifier elimination
- Real quantifier elimination is doubly exponential
- The complexity of linear problems in fields
- Variant quantifier elimination
- Variant real quantifier elimination: algorithm and application
- Verification and synthesis using real quantifier elimination
Cited in
(6)- On the arithmetic complexity of computing Gröbner bases of comaximal determinantal ideals
- Solving parameter-dependent semi-algebraic systems
- Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations
- Solving generic parametric linear matrix inequalities
- Refined bit complexity for the computation of at least one point per connected component of a smooth complete intersection real algebraic set
- Solving parametric linear matrix inequalities
This page was built for publication: Faster one block quantifier elimination for regular polynomial systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666546)
