Miklós Ajtai. The worst-case behavior of schnorr s algorithm approximating the shortest nonzero vector in a lattice. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. pages 396-406, ACM, 2003. [doi]
@inproceedings{Ajtai03,
title = {The worst-case behavior of schnorr s algorithm approximating the shortest nonzero vector in a lattice},
author = {Miklós Ajtai},
year = {2003},
doi = {10.1145/780542.780602},
url = {http://doi.acm.org/10.1145/780542.780602},
researchr = {https://researchr.org/publication/Ajtai03},
cites = {0},
citedby = {0},
pages = {396-406},
booktitle = {Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA},
publisher = {ACM},
isbn = {1-58113-674-9},
}