On propagation of equational constraints in CAD-based quantifier elimination

DOI10.1145/384101.384132zbMath1356.68287OpenAlexW1996657304MaRDI QIDQ2958937

Scott McCallum

Publication date: 3 February 2017

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

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

Mathematics Subject Classification ID

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

Related Items (15)

Curtains in CAD: Why Are They a Problem and How Do We Fix Them? ⋮ 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 ⋮ Lazard-style CAD and Equational Constraints ⋮ Proving an execution of an algorithm correct? ⋮ Cylindrical algebraic sub-decompositions ⋮ Cylindrical algebraic decomposition using validated numerics ⋮ On using Lazard's projection in CAD construction ⋮ Validity proof of Lazard's method for CAD construction ⋮ 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 ⋮ Special algorithm for stability analysis of multistable biological regulatory systems

This page was built for publication: On propagation of equational constraints in CAD-based quantifier elimination