Tight Bounds for the Subspace Sketch Problem with Applications

DOI10.1137/1.9781611975994.102MaRDI QIDQ5146880zbMATH OpenOpenAlexFDO

Authors Yi Li, Ruosong Wang, David P. Woodruff

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975994.102

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Sublinear randomized algorithms for skeleton decompositions
• Streaming Complexity of SVMs

This page was built for publication: Tight Bounds for the Subspace Sketch Problem with Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146880)