Input sparsity and hardness for robust subspace approximation

DOI10.1109/FOCS.2015.27MaRDI QIDQ6946886zbMATH OpenFDO

Authors Kenneth L. Clarkson, David P. Woodruff

Publication date 5 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2015.27

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(2)

• Simple heuristics yield provable algorithms for masked low-rank approximation
• Guessing efficiently for constrained subspace approximation

This page was built for publication: Input sparsity and hardness for robust subspace approximation

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