[Kle00] Finding the closest lattice vector when it’s unusually close
Authors: Philip N. Klein | Venue: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2000 | Source
Abstract
TODO — abstract.
BibTeX
@Inproceedings{SODA:Klein00,
author = {Philip N. Klein},
title = {Finding the closest lattice vector when it's unusually close},
pages = {937--941},
editor = {David B. Shmoys},
booktitle = {11th Annual {ACM}-{SIAM} Symposium on Discrete Algorithms},
address = {San Francisco, CA, USA},
month = {jan~9--11},
publisher = {{ACM-SIAM}},
year = {2000},
}