2014/02/04 by Adam Strzeboński, Adam Strzebonski, Strzebonski, Adam · 1 citation
Computer Science · Engineering · #Advanced Numerical Analysis Techniques #FOS: Computer and information sciences #Formal Methods in Verification #Mathematical Software (cs.MS) #Polynomial and algebraic computation #Symbolic Computation (cs.SC) #cs.MS #cs.SC
paper · pdf · doi:10.48550/arxiv.1402.0622
arxiv created 2014/02/04 · openalex publication_date 2014/02/04 · arxiv updated 2014/02/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.