Back to Results
First PageMeta Content
Babai / Symposium on Foundations of Computer Science


Codes April 12, Sanjeev Arora, L´ aszl´ o Babai, Jacques Stern, and Z. (Elizabeth) Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear
Add to Reading List

Document Date: 2014-04-12 03:21:38


Open Document

File Size: 71,94 KB

Share Result on Facebook