SVP$_p$ is Deterministically NP-Hard for all $p > 2$, Even to Approximate Within a Factor of $2^{\log^{1-\varepsilon} n}$

Documents similaires

• Deterministic Hardness of Approximation For SVP in all Finite $\ell_p$ Norms
  par: Hair, Isaac M, et autres
  Publié: (2026)
• Deterministic Hardness of Approximation of Unique-SVP and GapSVP in $\ell_p$ norms for $p>2$
  par: Hecht, Yahli, et autres
  Publié: (2025)
• On the NP-Hardness Approximation Curve for Max-2Lin(2)
  par: Martinsson, Björn
  Publié: (2024)
• Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication
  par: Riazanov, Artur, et autres
  Publié: (2025)
• Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
  par: Chavrimootoo, Michael C., et autres
  Publié: (2026)