On delineability of varieties in CAD-based quantifier elimination with two equational constraints

DOI10.1145/1576702.1576715zbMATH Open1237.14067OpenAlexW2013742763MaRDI QIDQ2883802FDOQ2883802

Christopher W. Brown, Scott McCallum

Publication date: 13 May 2012

Published in: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

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

Recommendations

• On using bi-equational constraints in CAD construction
• On propagation of equational constraints in CAD-based quantifier elimination
• Cylindrical algebraic sub-decompositions
• Partial cylindrical algebraic decomposition for quantifier elimination
• Quantifier elimination by cylindrical algebraic decomposition based on regular chains

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Real algebraic sets (14P05) Quantifier elimination, model completeness, and related topics (03C10)

Cited In (3)

• Validity proof of Lazard's method for CAD construction
• The Potential and Challenges of CAD with Equational Constraints for SC-Square
• Cylindrical algebraic decomposition with equational constraints

Uses Software

• QEPCAD

This page was built for publication: On delineability of varieties in CAD-based quantifier elimination with two equational constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883802)