NP-Hardness of Approximately Solving Linear Equations Over Reals

Subhash Khot, Dana Moshkovitz. NP-Hardness of Approximately Solving Linear Equations Over Reals. Electronic Colloquium on Computational Complexity (ECCC), 17:112, 2010. [doi]

Abstract

Abstract is missing.