Gaussian difference dynamics breaks 2^{n/2} barrier for shortest vector problem
New algorithm solves discrete Gaussian sampling and shortest vector problem in (3/2)^{n/2+o(n)} time and (4/3)^{n/2+o(n)} space.
Stories per day · 30 days
1 stories, newest first · one card per story