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]
@inproceedings{PeikertR07, title = {Lattices that admit logarithmic worst-case to average-case connection factors}, author = {Chris Peikert and Alon Rosen}, year = {2007}, doi = {10.1145/1250790.1250860}, url = {http://doi.acm.org/10.1145/1250790.1250860}, researchr = {https://researchr.org/publication/PeikertR07}, cites = {0}, citedby = {0}, pages = {478-487}, booktitle = {Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007}, editor = {David S. Johnson and Uriel Feige}, publisher = {ACM}, isbn = {978-1-59593-631-8}, }