works on
coding theory 1lattice algorithms 1locally dense lattices 1np-hardness 1shortest vector problem 1

From the 1 of 2 linked papers with an AI index.

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2026

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

Daqing Wan

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