External Links

    Journal: Electronic Colloquium on Computational Complexity (ECCC)

    Volume 4, Issue 59

    0 -- 0Jin-yi Cai. Approximating the SVP to within a factor (1 + 1/dim:::epsilon:::) is NP-hard under randomized reductions
    runs on