61 citations · 693 across the 58 of their papers we have counts for
6 papers · 1 filter
Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition
Matthew England, James H. Davenport
In the paper which inspired the SC-Square project, [E. Abraham, Building Bridges between Symbolic Computation and Satisfiability Checking, Proc. ISSAC '15, pp. 1-6, ACM, 2015] the…
Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition With Groebner Bases
Zongyan Huang, Matthew England, James H. Davenport +1
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. However, it can be exp…
Satisfiability Checking meets Symbolic Computation (Project Paper)
E. Abraham, J. Abbott, B. Becker +12
Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, impleme…
Satisfiability Checking and Symbolic Computation
E. Abraham, J. Abbott, B. Becker +12
Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they share common interests in the development, implementation and application of deci…
Need Polynomial Systems be Doubly-exponential?
James H. Davenport, Matthew England
Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. N…
The complexity of cylindrical algebraic decomposition with respect to polynomial degree
Matthew England, James H. Davenport
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponenti…