Login / Signup

-Hardness of Approximately Solving Linear Equations over Reals.

Subhash KhotDana Moshkovitz
Published in: SIAM J. Comput. (2013)
Keyphrases
  • linear equations
  • gauss seidel method
  • linear systems
  • complex valued
  • np complete
  • convergence rate
  • worst case
  • neural network
  • combinatorial optimization
  • transitive closure
  • constraint databases