Hardness of approximate optima in lattices, codes, and systems in linear equations

Sanjeev Arora, Laszlo Babai, Jacques Stern, Z. Sweedyk

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

86 Scopus citations

Fingerprint

Dive into the research topics of 'Hardness of approximate optima in lattices, codes, and systems in linear equations'. Together they form a unique fingerprint.

Keyphrases

Mathematics