arXiv (OAI Expanded)
open access
Euclidean SVP is NP-hard for Cyclic Lattices
We prove that exact Euclidean SVP is NP-hard under deterministic polynomial-time many-one reductions for full-rank cyclic integer lattices, equivalently full-rank ideals of $R_N:=\mathbb{Z}[X]/(X^N-1)$ in the coefficient norm. Hardness holds with $N=q-1$ for a varying odd prime $q$. As an applicatio
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On The Cyclicity of Algebraic Lattices#1035142
- A sparse effective Nullstellensatz#639159
- Irreducible $\mathbb{Z}_+$-modules over some $\mathbb{Z}_+$-rings#818943
- Irreducible $\mathbb{Z}_+$-modules over some $\mathbb{Z}_+$-rings#808951
- The integer group determinants for $GA(1,q)$#984823
Record · ID 1122720
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive