Exact p-CVP via Euclidean SVP in Polynomial Space
cs.DS, cs.CR
Submitted: 2026-11-05
Updated: 2026-11-05
Terminology
Sources
- Solving the Closest Vector Problem in $2^n$ Time--- The Discrete Gaussian Strikes Again!
- Solving the Closest Vector Problem with respect to l_p Norms
- From approximate to exact integer programming
- Improved Analysis of Kannan's Shortest Lattice Vector Algorithm
- Asymptotics of Random-Lattice Enumeration: Beyond HKZ via Dense Sublattices
- The Subspace Flatness Conjecture and Faster Integer Programming
- Discrete Gaussian Sampling Reduces to CVP and SVP
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles