Login / Signup

The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations.

Sanjeev AroraLászló BabaiJacques SternZ. Sweedyk
Published in: J. Comput. Syst. Sci. (1997)
Keyphrases
  • systems of linear equations
  • coefficient matrix
  • np hard
  • optimal solution
  • computational complexity
  • support vector
  • pairwise