Lazard-style CAD and Equational Constraints
From MaRDI portal
Publication:6060372
DOI10.1145/3597066.3597090arXiv2302.05813OpenAlexW4383213517MaRDI QIDQ6060372
Gregory Sankaran, Unnamed Author, Ali Kemal Uncu, James H. Davenport
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.05813
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Validity proof of Lazard's method for CAD construction
- Enhancements to Lazard's method for cylindrical algebraic decomposition
- Cylindrical algebraic decomposition with equational constraints
- Need Polynomial Systems Be Doubly-Exponential?
- Computing cylindrical algebraic decomposition via triangular decomposition
- Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases
- On propagation of equational constraints in CAD-based quantifier elimination
- Cylindrical algebraic decompositions for boolean combinations
- The Potential and Challenges of CAD with Equational Constraints for SC-Square
- Efficient projection orders for CAD
- Curtains in CAD: Why Are They a Problem and How Do We Fix Them?
- Lazard's CAD exploiting equality constraints
- Improved projection for cylindrical algebraic decomposition
- Truth table invariant cylindrical algebraic decomposition
This page was built for publication: Lazard-style CAD and Equational Constraints