3 problems

Let $L$ be a lattice of rank $n$, and let $\gamma(L)$ denote the lattice-dependent parameter introduced in the cited work. The parameter satisfies the universal exponential bound…

van Emde Boas's conjecture. For every $1 ot eq p < infty$, $mathrm{GapSVP}p$ is ${bf NP}$-hard.

Shortest vector problem NP-hardness conjecture. The shortest vector problem is $\mathcal{NP}$-hard.