One discrete Gaussian sample at an arbitrary parameter can be drawn in 2^(n/2+o(n)) expected time, resolving an open question from ADRS15.
Fine- grained hardness of CVP(P) – everything that we can prove (and nothing else)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time
One discrete Gaussian sample at an arbitrary parameter can be drawn in 2^(n/2+o(n)) expected time, resolving an open question from ADRS15.