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

Documenti analoghi

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