Need Polynomial Systems Be Doubly-Exponential?
From MaRDI portal
Publication:2819212
DOI10.1007/978-3-319-42432-3_20zbMath1434.68702arXiv1605.02912OpenAlexW2378550892WikidataQ59590558 ScholiaQ59590558MaRDI QIDQ2819212
Matthew England, James H. Davenport
Publication date: 28 September 2016
Published in: Mathematical Software – ICMS 2016 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.02912
Gröbner basesquantifier eliminationcomputer algebracylindrical algebraic decompositionequational constraint
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Lazard-style CAD and Equational Constraints, Using machine learning to improve cylindrical algebraic decomposition, The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cylindrical algebraic sub-decompositions
- Real quantifier elimination is doubly exponential
- Partial cylindrical algebraic decomposition for quantifier elimination
- Factors of iterated resultants and discriminants
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Dimension-dependent bounds for Gröbner bases of polynomial ideals
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Cylindrical algebraic decomposition using validated numerics
- Algorithmic methods for investigating equilibria in epidemic modeling
- Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition
- The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree
- Optimising Problem Formulation for Cylindrical Algebraic Decomposition
- Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains
- Computing cylindrical algebraic decomposition via triangular decomposition
- On propagation of equational constraints in CAD-based quantifier elimination
- An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- Cylindrical algebraic decompositions for boolean combinations
- Constructing a single open cell in a cylindrical algebraic decomposition
- Explicit factors of some iterated resultants and discriminants
- Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation)
- Constructing fewer open cells by GCD computation in CAD projection
- Sharp Effective Nullstellensatz
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition
- Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition
- Improved projection for cylindrical algebraic decomposition
- Truth table invariant cylindrical algebraic decomposition
