English
Related papers

Related papers: The DEWCAD Project: Pushing Back the Doubly Expone…

200 papers

Cylindrical Algebraic Decomposition (CAD) is an important tool within computational real algebraic geometry, capable of solving many problems to do with polynomial systems over the reals, but known to have worst-case computational…

Symbolic Computation · Computer Science 2018-04-24 Alexander I. Cowen-Rivers , Matthew England

Cylindrical Algebraic Decomposition (CAD) is an important tool within computational real algebraic geometry, capable of solving many problems for polynomial systems over the reals. It has long been studied by the Symbolic Computation…

Symbolic Computation · Computer Science 2018-11-01 Alexander Imani Cowen-Rivers , Matthew England

Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…

Symbolic Computation · Computer Science 2020-03-23 Matthew England , Russell Bradford , James H. Davenport

Cylindrical algebraic decomposition (CAD) is a core algorithm within Symbolic Computation, particularly for quantifier elimination over the reals and polynomial systems solving more generally. It is now finding increased application as a…

Symbolic Computation · Computer Science 2017-12-22 James H. Davenport , Matthew England

The cylindrical algebraic decomposition (CAD) is the only complete method used in practice for solving problems like quantifier elimination or SMT solving related to real algebra, despite its doubly exponential complexity. Recent…

When building a cylindrical algebraic decomposition (CAD) savings can be made in the presence of an equational constraint (EC): an equation logically implied by a formula. The present paper is concerned with how to use multiple ECs,…

Symbolic Computation · Computer Science 2015-07-20 Matthew England , Russell Bradford , James H. Davenport

Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advances: truth-table invariance, making the CAD invariant with…

Symbolic Computation · Computer Science 2014-07-15 Matthew England , Russell Bradford , Changbo Chen , James H. Davenport , Marc Moreno Maza , David Wilson

When using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is likely not the signs of those polynomials that are of paramount importance but rather the truth values of certain quantifier…

Symbolic Computation · Computer Science 2016-02-23 Russell Bradford , James H. Davenport , Matthew England , Scott McCallum , David Wilson

CylindricalAlgebraicDecomposition.m2 is the first implementation of Cylindrical Algebraic Decomposition (CAD) in Macaulay2. CAD decomposes space into 'cells' where input polynomials are sign-invariant. This package computes an Open CAD…

Symbolic Computation · Computer Science 2025-04-01 Corin Lee , Tereso del Río , Hamid Rahkooy

Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets. Originally introduced by Collins in the 1970s for use in quantifier elimination it has since found numerous applications within…

Symbolic Computation · Computer Science 2013-02-27 Matthew England

We present an algorithm which computes a cylindrical algebraic decomposition of a semialgebraic set using projection sets computed for each cell separately. Such local projection sets can be significantly smaller than the global projection…

Symbolic Computation · Computer Science 2014-05-21 Adam Strzebonski

Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications in algebraic geometry and beyond. We have previously reported on an implementation of CAD in Maple which offers…

Symbolic Computation · Computer Science 2015-03-24 Matthew England , David Wilson

We consider cylindrical algebraic decomposition (CAD) and the key concept of delineability which underpins CAD theory. We introduce the novel concept of projective delineability which is easier to guarantee computationally. We prove results…

Cylindrical algebraic decomposition (CAD) is an important tool, both for quantifier elimination over the reals and a range of other applications. Traditionally, a CAD is built through a process of projection and lifting to move the problem…

Symbolic Computation · Computer Science 2014-08-28 Matthew England , David Wilson , Russell Bradford , James H. Davenport

Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…

Symbolic Computation · Computer Science 2013-07-10 Russell Bradford , James H. Davenport , Matthew England , David Wilson

Cylindrical algebraic decomposition (CAD) is a key tool for solving problems in real algebraic geometry and beyond. In recent years a new approach has been developed, where regular chains technology is used to first build a decomposition in…

Symbolic Computation · Computer Science 2014-08-28 Matthew England , Russell Bradford , James H. Davenport , David Wilson

The Cylindrical Algebraic Decomposition (CAD) method is currently the only complete algorithm used in practice for solving real-algebraic problems. To ameliorate its doubly-exponential complexity, different exploration-guided adaptations…

Symbolic Computation · Computer Science 2025-08-04 Jasper Nalbach , Erika Ábrahám

Cylindrical algebraic decompositions (CADs) are a key tool in real algebraic geometry, used primarily for eliminating quantifiers over the reals and studying semi-algebraic sets. In this paper we introduce cylindrical algebraic…

Symbolic Computation · Computer Science 2014-06-27 D. J. Wilson , R. J. Bradford , J. H. Davenport , M. England

We present a new algorithm for determining the satisfiability of conjunctions of non-linear polynomial constraints over the reals, which can be used as a theory solver for satisfiability modulo theory (SMT) solving for non-linear real…

Symbolic Computation · Computer Science 2021-06-17 Erika Ábrahám , James H. Davenport , Matthew England , Gereon Kremer

An alternative to Density Functional Theory are wavefunction based electronic structure calculations for solids. In order to perform them the Exponential Wall (EW) problem has to be resolved. It is caused by an exponential increase of the…

Chemical Physics · Physics 2017-06-07 Peter Fulde , Hermann Stoll
‹ Prev 1 2 3 10 Next ›