384 citations · 1.1k across the 22 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CC2018
Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols
Lijie Chen, Ruosong Wang
The polynomial method from circuit complexity has been applied to several fundamental problems and obtains the state-of-the-art running times. As observed in [Alman and Williams, S…
cs.DS2018★ 1 cited
Tight Bounds for Oblivious Subspace Embeddings
Ruosong Wang, David P. Woodruff
An oblivious subspace embedding is a distribution over matrices such that for any fixed matrix , $$\Pr_Π[\textrm{for all }x, \ \|Ax\|_p \l…