Toeplitz Low-Rank Approximation with Sublinear Query Complexity

Michael Kapralov, Hannah Lawrence, Mikhail Makarov, Cameron Musco, Kshiteej Sheth. Toeplitz Low-Rank Approximation with Sublinear Query Complexity. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 4127-4158, SIAM, 2023. [doi]

@inproceedings{KapralovLMMS23,
  title = {Toeplitz Low-Rank Approximation with Sublinear Query Complexity},
  author = {Michael Kapralov and Hannah Lawrence and Mikhail Makarov and Cameron Musco and Kshiteej Sheth},
  year = {2023},
  doi = {10.1137/1.9781611977554.ch159},
  url = {https://doi.org/10.1137/1.9781611977554.ch159},
  researchr = {https://researchr.org/publication/KapralovLMMS23},
  cites = {0},
  citedby = {0},
  pages = {4127-4158},
  booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023},
  editor = {Nikhil Bansal 0001 and Viswanath Nagarajan},
  publisher = {SIAM},
  isbn = {978-1-61197-755-4},
}