Representing hard lattices with O(n log n) bits

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]

Possibly Related Publications

The following publications are possibly variants of this publication: