Simple CAD construction and its applications
The method of quantifier elimination by cylindrical algebraic decomposition (CAD) takes a formula from the theory of real closed fields as input, and constructs a CAD of the space of unquantified variables. CAD \(B\) is ``simpler than CAD \(A\), if each cell in \(B\) is the union of some cells of \(A\). The author presents two algorithms for simplifying the so called truth-invariant CAD algorithm introduced by \textit{G. E. Collins} and \textit{H. Hong} [ibid. 12, No. 3, 299-328 (1991; Zbl 0754.68063)]. Examples are presented which show the performance of this new very fast method.
- scientific article; zbMATH DE number 1262462
- Partial cylindrical algebraic decomposition for quantifier elimination
- Cylindrical algebraic decompositions for Boolean combinations
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- The complexity of quantifier elimination and cylindrical algebraic decomposition
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1262462 (Why is no real title available?)
- scientific article; zbMATH DE number 1263359 (Why is no real title available?)
- scientific article; zbMATH DE number 1263423 (Why is no real title available?)
- scientific article; zbMATH DE number 1157658 (Why is no real title available?)
- Partial cylindrical algebraic decomposition for quantifier elimination
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Simplification of quantifier-free formulae over ordered fields
- Real zeros of the zero-dimensional parametric piecewise algebraic variety
- Partial cylindrical algebraic decomposition for quantifier elimination
- Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas
- From simplification to a partial theory solver for non-linear real polynomial constraints
- Special algorithm for stability analysis of multistable biological regulatory systems
- Algorithmic methods for investigating equilibria in epidemic modeling
- Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation)
- A simple quantifier-free formula of positive semidefinite cyclic ternary quartic forms
- Black-box/white-box simplification and applications to quantifier elimination
- Cylindrical algebraic decompositions for Boolean combinations
- A decision procedure for probability calculus with applications
- Computing integrals over polynomially defined regions and their boundaries in 2 and 3 dimensions
- Fast simplifications for Tarski formulas based on monomial inequalities
- scientific article; zbMATH DE number 1262462 (Why is no real title available?)
- scientific article; zbMATH DE number 1747605 (Why is no real title available?)
- QEPCAD B
- Numerical and Symbolic Studies of the Peaceable Queens Problem
- Constraint Markov chains
- Solving parametric piecewise polynomial systems
- On minimal and minimum cylindrical algebraic decompositions
- Further results on minimal and minimum cylindrical algebraic decompositions
This page was built for publication: Simple CAD construction and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5938543)
