Metraipolis › archive › dc_7bd9c5ad0cee

Euclidean SVP is deterministically NP-hard to approximate within any constant factor — arXiv:2608.12664

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.12664
License (as archived)
CC0-1.0
Archived
2026-10-19T04:57:32.123Z
SHA-256 of the archived text
2f0d967ef9ffbca3dbaf23ff64b0f5a173b951451175c3b8ae40480137401076
Stable URL of this page
https://metraipolis.com/documento/dc_7bd9c5ad0cee

How to cite

Euclidean SVP is deterministically NP-hard to approximate within any constant factor — arXiv:2608.12664 — arXiv (en), https://arxiv.org/abs/2608.12664 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7bd9c5ad0cee (Metraipolis archive dc_7bd9c5ad0cee, sha256 2f0d967ef9ffbca3dbaf23ff64b0f5a173b951451175c3b8ae40480137401076)
BibTeX
@misc{dc7bd9c5ad0cee,
  title = {Euclidean SVP is deterministically NP-hard to approximate within any constant factor — arXiv:2608.12664},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.12664},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7bd9c5ad0cee; sha256 2f0d967ef9ffbca3dbaf23ff64b0f5a173b951451175c3b8ae40480137401076},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12664. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove that, for every constant $\rho>1$, the Euclidean shortest vector problem is NP-hard to approximate within any constant factor $\rho$ under a deterministic polynomial-time many-one reduction. This extends our previous deterministic NP-hardness result from $\rho<\sqrt 2$ to arbitrary constants and gives a deterministic version of Khot's randomized arbitrary-constant theorem.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in cs.CC).
Categorie arXiv: Computational Complexity (cs.CC) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2608.12664 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T04:53:19.649Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).