1 citations · 1 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
Jiaqi Liu, Yansong Feng, Yanbin Pan
Let range over primes congruent to modulo . Let be a primitive th root of unity, and put , with ring of integers $\mathcal{O}_K=\mathbb{Z}[ζ_…
cs.CC2026
CVP Is NP-Complete for Principal Cyclotomic Ideals
Jiaqi Liu, Yansong Feng, Yanbin Pan
We prove that exact Euclidean decision-CVP is -complete on the coefficient lattices of nonzero principal ideals in the power-of-two cyclotomic rings $R_d:=\mathbb{Z}[y…