Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness

Cameron Musco, Praneeth Netrapalli, Aaron Sidford, Shashanka Ubaru, David P. Woodruff. Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness. In Anna R. Karlin, editor, 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA. Volume 94 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

@inproceedings{MuscoNSUW18,
  title = {Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness},
  author = {Cameron Musco and Praneeth Netrapalli and Aaron Sidford and Shashanka Ubaru and David P. Woodruff},
  year = {2018},
  doi = {10.4230/LIPIcs.ITCS.2018.8},
  url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.8},
  researchr = {https://researchr.org/publication/MuscoNSUW18},
  cites = {0},
  citedby = {0},
  booktitle = {9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA},
  editor = {Anna R. Karlin},
  volume = {94},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-060-6},
}