Constructing a single open cell in a cylindrical algebraic decomposition

DOI10.1145/2465506.2465952zbMath1360.68924OpenAlexW1982166299MaRDI QIDQ2963226

Christopher W. Brown

Publication date: 10 February 2017

Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2465506.2465952

zbMATH Keywords

cylindrical algebraic decompositionpolynomial inequalities

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items

Recent Advances in Real Geometric Reasoning ⋮ Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) ⋮ Levelwise construction of a single cylindrical algebraic cell ⋮ Cylindrical algebraic sub-decompositions ⋮ Truth table invariant cylindrical algebraic decomposition ⋮ Cylindrical algebraic decomposition using local projections ⋮ Need Polynomial Systems Be Doubly-Exponential? ⋮ 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 ⋮ Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints ⋮ Constructing a single cell in cylindrical algebraic decomposition ⋮ Special algorithm for stability analysis of multistable biological regulatory systems