Abstract
Cylindrical Algebraic Decomposition (CAD) is a very powerful algorithm with many potential applications, however, its doubly exponential complexity limits its usability. In this document we demonstrate how the techniques of adjacency and clustering would reduce the double exponent of CAD complexity.
| Original language | English |
|---|---|
| Pages | 69-72 |
| Number of pages | 4 |
| Publication status | Accepted/In press - 2022 |
| Event | XVII Meeting on Computational Algebra and Applications. - Castellón de la Plana, Spain Duration: 20 Jun 2022 → 22 Jun 2023 https://www.fue.uji.es/eaca2022 |
Conference
| Conference | XVII Meeting on Computational Algebra and Applications. |
|---|---|
| Abbreviated title | EACA 2022 |
| Country/Territory | Spain |
| City | Castellón de la Plana |
| Period | 20/06/22 → 22/06/23 |
| Internet address |