Approximating SVP::infty:: to within Almost-Polynomial Factors is NP-hard

Irit Dinur. Approximating SVP::infty:: to within Almost-Polynomial Factors is NP-hard. Electronic Colloquium on Computational Complexity (ECCC), 6(16), 1999. [doi]

Authors

Irit Dinur

This author has not been identified. Look up 'Irit Dinur' in Google