Euclidean SVP is deterministically NP-hard to approximate within any constant factor

Daqing Wan

We prove that, for every constant $\rho >1$, the Euclidean shortest vector problem is NP-hard to approximate within any constant factor $\rho$ under a deterministic polynomial-time many-o…