Login / Signup

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

Sanjeev AroraLászló BabaiJacques SternZ. Sweedyk
Published in: FOCS (1993)
Keyphrases
  • systems of linear equations
  • computational complexity
  • multi class