Divide-And-Conquer Computation of Cylindrical Algebraic Decomposition
classification
💻 cs.SC
cs.MS
keywords
algebraiccylindricalalgorithmcomputationdecompositiondivide-and-conquerinputsubformulas
read the original abstract
We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets of the subformulas, and combines the results. We propose a graph-based heuristic to find a suitable partitioning of the input and present empirical comparison with direct CAD computation.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.