Improved projection for cylindrical algebraic decomposition
From MaRDI portal
Publication:5950980
DOI10.1006/jsco.2001.0463zbMath0981.68186OpenAlexW2021431116MaRDI QIDQ5950980
Publication date: 2 January 2002
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8d6df4b49ac8bb8e0c3ec78cfbacd87698fc9705
Symbolic computation and algebraic computation (68W30) Quantifier elimination, model completeness, and related topics (03C10)
Related Items
Variable Ordering Selection for Cylindrical Algebraic Decomposition with Artificial Neural Networks, Multivariate discriminant and iterated resultant, Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation), An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination, Deciding first-order formulas involving univariate mixed trigonometric-polynomials, Lazard-style CAD and Equational Constraints, CAD and topology of semi-algebraic sets, On the topology of real algebraic plane curves, Levelwise construction of a single cylindrical algebraic cell, Variant quantifier elimination, Discovering polynomial Lyapunov functions for continuous dynamical systems, Open weak CAD and its applications, Cylindrical algebraic sub-decompositions, Global optimization of polynomials over real algebraic sets, Quantifier elimination for a class of exponential polynomial formulas, Cylindrical algebraic decomposition using validated numerics, On using Lazard's projection in CAD construction, Proving inequalities and solving global optimization problems via simplified CAD projection, Validity proof of Lazard's method for CAD construction, A DECISION PROCEDURE FOR PROBABILITY CALCULUS WITH APPLICATIONS, Using machine learning to improve cylindrical algebraic decomposition, An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions, A Simple Quantifier-Free Formula of Positive Semidefinite Cyclic Ternary Quartic Forms, Truth table invariant cylindrical algebraic decomposition, Cylindrical algebraic decomposition using local projections, Need Polynomial Systems Be Doubly-Exponential?, Fully incremental cylindrical algebraic decomposition, Cylindrical algebraic decomposition with equational constraints, The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree, Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms, A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic, An efficient algorithm for the stratification and triangulation of an algebraic surface, Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition, Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints, Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure, Constructing a single cell in cylindrical algebraic decomposition, Special algorithm for stability analysis of multistable biological regulatory systems
Uses Software
Cites Work
- Quantifier elimination: Optimal solution for two classical examples
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Partial cylindrical algebraic decomposition for quantifier elimination
- Complexity of deciding Tarski algebra
- Solving zero-dimensional systems through the rational univariate representation
- Testing stability by quantifier elimination
- Solving systems of strict polynomial inequalities
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
