Tereso del Río, Matthew England
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 clusteringwould reduce the double exponent of CAD complexity.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados