"Approximating CVP to Within Almost Polynomial Factor is NP-Hard"

Irit Dinur, Guy Kindler, Shmuel Safra (1998)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2023-09-30

a service of  Schloss Dagstuhl - Leibniz Center for Informatics