柱形代数分解的分治计算
Divide-And-Conquer Computation of Cylindrical Algebraic Decomposition
摘要:
我们提出了一个分而治之的版本的柱形代数分解(CAD)算法。该算法将输入表示为子公式的布尔组合,计算子公式的解集的柱形代数分解,并组合结果。我们提出了一个基于图形的启发式找到一个合适的分区的输入和目前的经验比较与直接CAD计算。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。