@InProceedings{dey_et_al:LIPIcs.ITCS.2023.42,
author = {Dey, Papri and Kannan, Ravi and Ryder, Nick and Srivastava, Nikhil},
title = {{Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {42:1--42:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.42},
URN = {urn:nbn:de:0030-drops-175450},
doi = {10.4230/LIPIcs.ITCS.2023.42},
annote = {Keywords: Symbolic algorithms, numerical algorithms, linear algebra}
}