Lattices that admit logarithmic worst-case to average-case connection factors

Chris Peikert, Alon Rosen. Lattices that admit logarithmic worst-case to average-case connection factors. In David S. Johnson, Uriel Feige, editors, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007. pages 478-487, ACM, 2007. [doi]

Abstract

Abstract is missing.