arXiv (All)
open access
CVP Is NP-Complete for Principal Cyclotomic Ideals
We prove that exact Euclidean decision-CVP is $\mathsf{NP}$-complete on the coefficient lattices of nonzero principal ideals in the power-of-two cyclotomic rings $R_d:=\mathbb{Z}[y]/(y^d+1)$. Our deterministic reduction from Exact Cover by 3-Sets (X3C) produces a target and a squared threshold $Δ$ s
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
- Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families#781144
- Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families#779769
- The complexity of computing the covering radius of a Euclidean lattice#1129631
- Adelic reduction of module lattices#1117648
- Normality of ideals beyond the standard graded setting: families from numerical semigroup rings#1011787
Record · ID 1035598
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