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

DOI10.1145/1576702.1576715zbMath1237.14067OpenAlexW2013742763MaRDI QIDQ2883802

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

Mathematics Subject Classification ID

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

Related Items

Validity proof of Lazard's method for CAD construction, Cylindrical algebraic decomposition with equational constraints

Uses Software

• QEPCAD