Constructing fewer open cells by GCD computation in CAD projection

DOI10.1145/2608628.2608676zbMath1325.68286arXiv1401.4953OpenAlexW3103265545MaRDI QIDQ3452400

Jing Jun Han, Liyun Dai, Bican Xia

Publication date: 11 November 2015

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

Full work available at URL: https://arxiv.org/abs/1401.4953

zbMATH Keywords

polynomialsemi-definitenessCAD projection

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items

Multivariate discriminant and iterated resultant ⋮ Detection of special curves via the double resultant ⋮ Open weak CAD and its applications ⋮ Global optimization of polynomials over real algebraic sets ⋮ Proving inequalities and solving global optimization problems via simplified CAD projection ⋮ Using machine learning to improve cylindrical algebraic decomposition ⋮ Truth table invariant cylindrical algebraic decomposition ⋮ Need Polynomial Systems Be Doubly-Exponential? ⋮ Cylindrical algebraic decomposition with equational constraints ⋮ The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree

Uses Software

• Jordan

Cites Work

• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item