Irit Dinur. Approximating SVP::infty:: to within Almost-Polynomial Factors is NP-hard. Electronic Colloquium on Computational Complexity (ECCC), 6(16), 1999. [doi]
@article{ECCC-TR99-016,
title = {Approximating SVP::infty:: to within Almost-Polynomial Factors is NP-hard},
author = {Irit Dinur},
year = {1999},
url = {http://eccc.hpi-web.de/eccc-reports/1999/TR99-016/index.html},
researchr = {https://researchr.org/publication/ECCC-TR99-016},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {6},
number = {16},
}