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]
Abstract is missing.