Polynomial-Factor Deterministic NP-Hardness for SVP in Every lp Norm with p > 2
For every constant $2<p<\infty$ and every constant \[ 0<\varepsilon< \min\left\{\frac{p-2}{4p},\frac18\right\}, \] we give a deterministic polynomial-time reduction from 3SAT to $M^\varepsilon$-GapSVP...
For every constant $22$ of Hair and Sahai [STOC'26].
Source: arXiv