Work

Hardness of Approximately Solving Linear Equations Over Reals.

Year: 2010

Type: preprint

Source: Electronic colloquium on computational complexity

Authors: Dana Moshkovitz, Subhash Khot

Institution: New York University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2054982957

Cites: 8

Cited by: 3

Related to: 10