The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree

Matthew England, James H. Davenport. The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree. In Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing - 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings. Volume 9890 of Lecture Notes in Computer Science, pages 172-192, Springer, 2016. [doi]

@inproceedings{EnglandD16,
  title = {The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree},
  author = {Matthew England and James H. Davenport},
  year = {2016},
  doi = {10.1007/978-3-319-45641-6_12},
  url = {http://dx.doi.org/10.1007/978-3-319-45641-6_12},
  researchr = {https://researchr.org/publication/EnglandD16},
  cites = {0},
  citedby = {0},
  pages = {172-192},
  booktitle = {Computer Algebra in Scientific Computing - 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings},
  editor = {Vladimir P. Gerdt and Wolfram Koepf and Werner M. Seiler and Evgenii V. Vorozhtsov},
  volume = {9890},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-45640-9},
}