Miklós Ajtai. Representing hard lattices with O(n log n) bits. In Harold N. Gabow, Ronald Fagin, editors, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. pages 94-103, ACM, 2005. [doi]
@inproceedings{Ajtai05,
title = {Representing hard lattices with O(n log n) bits},
author = {Miklós Ajtai},
year = {2005},
doi = {10.1145/1060590.1060604},
url = {http://doi.acm.org/10.1145/1060590.1060604},
researchr = {https://researchr.org/publication/Ajtai05},
cites = {0},
citedby = {0},
pages = {94-103},
booktitle = {Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005},
editor = {Harold N. Gabow and Ronald Fagin},
publisher = {ACM},
isbn = {1-58113-960-8},
}