The complexity of cylindrical algebraic decomposition with respect to polynomial degree

Matthew England, James H. Davenport

Research output: Chapter or section in a book/report/conference proceedingChapter in a published conference proceeding

18 Citations (SciVal)
98 Downloads (Pure)


Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be improved by adapting to take advantage of any equational constraints (ECs): equations logically implied by the input. Intuitively, we expect the double exponent in the complexity to decrease by one for each EC. In ISSAC 2015 the present authors proved this for the factor in the complexity bound dependent on the number of polynomials in the input. However, the other term, that dependent on the degree of the input polynomials, remained unchanged.

In the present paper the authors investigate how CAD in the presence of ECs could be further refined using the technology of Groebner Bases to move towards the intuitive bound for polynomial degree.
Original languageEnglish
Title of host publicationComputer Algebra in Scientific Computing
Subtitle of host publication18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings
EditorsV. P. Gerdt, W. Koepf, W. M. Seiler, E. V. Vorozhtsov
PublisherSpringer Verlag
Number of pages21
ISBN (Print)9783319456409
Publication statusPublished - 9 Sept 2016

Publication series

NameLecture Notes in Computer Science
ISSN (Electronic)1611-3349


  • computer algebra
  • cylindrical algebraic decomposition
  • equational constraint
  • Groebner bases
  • quantifier elimination

ASJC Scopus subject areas

  • Computational Theory and Mathematics


Dive into the research topics of 'The complexity of cylindrical algebraic decomposition with respect to polynomial degree'. Together they form a unique fingerprint.

Cite this