Algorithms and Hardness for Subspace Approximation

Amit Deshpande, Madhur Tulsiani, Nisheeth K. Vishnoi. Algorithms and Hardness for Subspace Approximation. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 482-496, SIAM, 2011. [doi]

Abstract

Abstract is missing.