Cylindrical algebraic sub-decompositions
- Submitting institution
-
The University of Bath
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 146439989
- Type
- D - Journal article
- DOI
-
10.1007/s11786-014-0191-z
- Title of journal
- Mathematics in Computer Science
- Article number
- -
- First page
- 263
- Volume
- 8
- Issue
- 2
- ISSN
- 1661-8270
- Open access status
- Out of scope for open access requirements
- Month of publication
- June
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 10
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The various algorithms that exist to compute cylindrical algebraic decomposition (CAD) have notoriously bad complexity (doubly exponential). This paper presents new ways of focusing down on the parts of the CAD that are actually important to the problem in hand. This is important as it produces practical savings in implementations, and being able to solve problems that were previously intractable. Further, this opened the door to later improvements of applications of CAD in other fields, such as robot motion planning and epidemic modelling.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -