ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1704.04163
  4. Cited By
Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and
  Hardness

Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness

13 April 2017
Cameron Musco
Praneeth Netrapalli
Aaron Sidford
Shashanka Ubaru
David P. Woodruff
ArXivPDFHTML

Papers citing "Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness"

4 / 4 papers shown
Title
Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
Michal Dereziñski
Christopher Musco
Jiaming Yang
58
2
0
09 May 2024
Optimal Query Complexities for Dynamic Trace Estimation
Optimal Query Complexities for Dynamic Trace Estimation
David P. Woodruff
Fred Zhang
Qiuyi Zhang
39
4
0
30 Sep 2022
Quantum algorithms for spectral sums
Quantum algorithms for spectral sums
Alessandro Luongo
Changpeng Shao
31
4
0
12 Nov 2020
Hutch++: Optimal Stochastic Trace Estimation
Hutch++: Optimal Stochastic Trace Estimation
R. A. Meyer
Cameron Musco
Christopher Musco
David P. Woodruff
31
106
0
19 Oct 2020
1