Exact ℓ_p-CVP reduced to Euclidean SVP in polynomial space
The reduction enables polynomial-space algorithms for exact ℓ_p-CVP using existing SVP solvers, with time bounds N^{N/(2e)+o(N)} for p=2.
Stories per day · 30 days
1 stories, newest first · one card per story