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

Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk

Research output: Contribution to journalArticlepeer-review

246 Scopus citations

Fingerprint

Dive into the research topics of 'The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations'. Together they form a unique fingerprint.

Keyphrases

Mathematics