<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-04-12 03:21:38Babai Symposium on Foundations of Computer Science |
Add to Reading List |
| First Page | Document Content | |
|---|---|---|
Date: 2014-04-12 03:21:38Babai Symposium on Foundations of Computer Science |
Add to Reading List |
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