Polynomial-Factor Deterministic NP-Hardness for SVP in Every p Norm with p>2
cs.CC
Submitted: 2026-08-14
Updated: 2026-11-07
Terminology
Sources
- Deterministic Hardness of Approximation For SVP in all Finite $\ell_p$ Norms
- Euclidean SVP is deterministically NP-hard to approximate within any constant factor
- NP-hardness of SVP in Euclidean Space
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?