Approximating SVP∞ to within almost-polynomial factors is NP-hard
Irit DinurVolume:
285
Year:
2002
Language:
english
Pages:
17
DOI:
10.1016/s0304-3975(01)00290-0
File:
PDF, 190 KB
english, 2002