Go to the corresponding LIPIcs Volume Portal 
Dey, Papri ; Kannan, Ravi ; Ryder, Nick ; Srivastava, Nikhil
pdfformat: 

@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:142:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772631}, ISSN = {18688969}, year = {2023}, volume = {251}, editor = {Tauman Kalai, Yael}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17545}, URN = {urn:nbn:de:0030drops175450}, doi = {10.4230/LIPIcs.ITCS.2023.42}, annote = {Keywords: Symbolic algorithms, numerical algorithms, linear algebra} }
Keywords:  Symbolic algorithms, numerical algorithms, linear algebra  
Collection:  14th Innovations in Theoretical Computer Science Conference (ITCS 2023)  
Issue Date:  2023  
Date of publication:  01.02.2023 