Deterministic Hardness of Approximation For SVP in all Finite $\ell_p$ Norms

Documents similaires

• SVP$_p$ is Deterministically NP-Hard for all $p > 2$, Even to Approximate Within a Factor of $2^{\log^{1-\varepsilon} n}$
  par: Hair, Isaac M., et autres
  Publié: (2025)
• Deterministic Hardness of Approximation of Unique-SVP and GapSVP in $\ell_p$ norms for $p>2$
  par: Hecht, Yahli, et autres
  Publié: (2025)
• Hardness of the Binary Covering Radius Problem in Large $\ell_p$ Norms
  par: Bennett, Huck, et autres
  Publié: (2026)
• Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all $\ell_p$ Norms
  par: Bennett, Huck, et autres
  Publié: (2022)
• On Approximability of Steiner Tree in $\ell_p$-metrics
  par: Fleischmann, Henry, et autres
  Publié: (2023)