Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of variables in the worst case, but the actual computation time can vary greatly. It is possible to offer different formulations for a given problem leading to great differences in tractability. In this paper we suggest a new measure for CAD complexity which takes into account the real geometry of the problem. This leads to new heuristics for choosing: the variable ordering for a CAD problem, a designated equational constraint, and formulations for truth-table invariant CADs (TTICADs). We then consider the possibility of using Gröbner bases to precondition TTICAD and when such formulations constitute the creation of a new problem. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bradford, R., Davenport, J. H., England, M., & Wilson, D. (2013). Optimising problem formulation for cylindrical algebraic decomposition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7961 LNAI, pp. 19–34). https://doi.org/10.1007/978-3-642-39320-4_2
Mendeley helps you to discover research relevant for your work.