A dataset for suggesting variable orderings for cylindrical algebraic decompositions

This dataset contains the running time and the number of cells of the CylindricalAlgebraicDecompose command in the RegularChains library of Maple under all possible variable orderings for more than 20K number of randomly generated polynomial systems of three variables (12141 examples) and four variables (11800 examples). For each example, the running time of the worst ordering is at least twice that of the best variable ordering.

It can be used for benchmarking and designing heuristic methods and machine learning models for suggesting variable orderings for CADs. Please refer readme.txt for more detailed information of the dataset and the tiny difference between v1, v2 and v3.