"Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard."

Irit Dinur, Guy Kindler, Shmuel Safra (1998)

Details and statistics

DOI: 10.1109/SFCS.1998.743433

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

a service of  Schloss Dagstuhl - Leibniz Center for Informatics