Abstract
Cylindrical algebraic decomposition (CAD) is a key tool for problems in real algebraic geometry and beyond. When using CAD there is often a choice over the variable ordering to use, with some problems infeasible in one ordering but simple in another. Here we discuss a recent experiment comparing three heuristics for making this choice on thousands of examples.
| Original language | English |
|---|---|
| Pages (from-to) | 121-123 |
| Number of pages | 3 |
| Journal | ACM Communications in Computer Algebra |
| Volume | 48 |
| Issue number | 3-4 |
| DOIs | |
| Publication status | Published - 5 Feb 2015 |
| Externally published | Yes |
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Computational Mathematics