External Links

    Journal: Electronic Colloquium on Computational Complexity (ECCC)

    Volume 5, Issue 48

    0 -- 0Irit Dinur, Guy Kindler, Shmuel Safra. Approximating CVP to Within Almost Polynomial Factor is NP-Hard
    runs on