Tight Bounds for ℓp Oblivious Subspace Embeddings

DOI10.1137/1.9781611975482.110zbMath1432.68373arXiv1801.04414OpenAlexW2786586993MaRDI QIDQ5236294

Ruosong Wang, David P. Woodruff

Publication date: 15 October 2019

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

Full work available at URL: https://arxiv.org/abs/1801.04414

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Embeddings of discrete metric spaces into Banach spaces; applications in topology and computer science (46B85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Metric embeddings as related to computational problems and algorithms (68R12)

Related Items (1)

Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations

This page was built for publication: Tight Bounds for ℓ_p Oblivious Subspace Embeddings