Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Subhash Khot, Dana Moshkovitz. NP-Hardness of Approximately Solving Linear Equations over Reals. SIAM Journal on Computing, 42(3):752-791, 2013. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: NP-Hardness of Approximately Solving Linear Equations Over RealsSubhash Khot, Dana Moshkovitz. eccc, 17:112, 2010. [doi] NP-hardness of approximately solving linear equations over realsSubhash Khot, Dana Moshkovitz. stoc 2011: 413-420 [doi] Hardness of Approximately Solving Linear Equations Over RealsDana Moshkovitz, Subhash Khot. eccc, 17:53, 2010. [doi]
The following publications are possibly variants of this publication: