Determines exact asymptotics for approximate Voronoi cell volumes, yielding improved CVPP complexity bounds with subexponential memory and continuous advice-query trade-offs.
Nguyên and Thomas Vidick, Sieve algorithms for the shortest vector prob- lem are practical, Journal of Mathematical Cryptology 2 (2008), 181–207
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Approximate Voronoi cells for lattices, revisited
Determines exact asymptotics for approximate Voronoi cell volumes, yielding improved CVPP complexity bounds with subexponential memory and continuous advice-query trade-offs.