Irit Dinur. Approximating SVP::infty:: to within Almost-Polynomial Factors Is NP-Hard. In Gian Carlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi, editors, Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings. Volume 1767 of Lecture Notes in Computer Science, pages 263-276, Springer, 2000. [doi]
@inproceedings{Dinur00,
title = {Approximating SVP::infty:: to within Almost-Polynomial Factors Is NP-Hard},
author = {Irit Dinur},
year = {2000},
url = {http://link.springer.de/link/service/series/0558/bibs/1767/17670263.htm},
researchr = {https://researchr.org/publication/Dinur00},
cites = {0},
citedby = {0},
pages = {263-276},
booktitle = {Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings},
editor = {Gian Carlo Bongiovanni and Giorgio Gambosi and Rossella Petreschi},
volume = {1767},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-67159-5},
}