On the complexity of algebraic numbers, and the bit-complexity of straight-line programs

Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap. On the complexity of algebraic numbers, and the bit-complexity of straight-line programs. Computability, 12(2):145-173, 2023. [doi]

@article{AllenderBDP23,
  title = {On the complexity of algebraic numbers, and the bit-complexity of straight-line programs},
  author = {Eric Allender and Nikhil Balaji and Samir Datta and Rameshwar Pratap},
  year = {2023},
  doi = {10.3233/COM-220407},
  url = {https://doi.org/10.3233/COM-220407},
  researchr = {https://researchr.org/publication/AllenderBDP23},
  cites = {0},
  citedby = {0},
  journal = {Computability},
  volume = {12},
  number = {2},
  pages = {145-173},
}