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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.