Metraipolis › archive › dc_52be444acc75
Faster SVP in Polynomial Space — arXiv:2609.21612
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21612
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:46:01.419Z
- SHA-256 of the archived text
9c67c1818c04294385d93ed0dc2e62731427dccd60fe5d2083ca431d040afbe9- Stable URL of this page
https://metraipolis.com/documento/dc_52be444acc75
How to cite
Faster SVP in Polynomial Space — arXiv:2609.21612 — arXiv (en), https://arxiv.org/abs/2609.21612 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_52be444acc75 (Metraipolis archive dc_52be444acc75, sha256 9c67c1818c04294385d93ed0dc2e62731427dccd60fe5d2083ca431d040afbe9)
BibTeX
@misc{dc52be444acc75,
title = {Faster SVP in Polynomial Space — arXiv:2609.21612},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21612},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_52be444acc75; sha256 9c67c1818c04294385d93ed0dc2e62731427dccd60fe5d2083ca431d040afbe9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21612. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Kannan's algorithm, as analyzed by Hanrot and Stehlé in 2007, solves the exact Euclidean shortest vector problem in polynomial space and $n^{\frac{n}{2e}+o(n)}$ time. In the classical setting with polynomial space, we obtain the first improvement on this bound via a randomized algorithm that runs in $n^{\frac{n}{4e}+o(n)}$ time. The main idea is to represent a fixed shortest vector in many ways as a difference of samples, thereby enabling the low-space collision search of Lyu and Zhu (SODA 2023) to replace exhaustive enumeration in the original analysis.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.21612 — 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-10T02:29:43.006Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).