Subhash Khot, Dana Moshkovitz. NP-hardness of approximately solving linear equations over reals. In Lance Fortnow, Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. pages 413-420, ACM, 2011. [doi]
No references recorded for this publication.
No citations of this publication recorded.