Login / Signup
NP-hardness of approximately solving linear equations over reals.
Subhash Khot
Dana Moshkovitz
Published in:
STOC (2011)
Keyphrases
</>
linear equations
np hardness
gauss seidel method
np hard
mixed integer
approximation algorithms
linear systems
discrete tomography
neural network
worst case analysis
special case
sufficient conditions
optimal solution
linear programming
dynamic systems