pith. sign in

Title resolution pending

Daniele Micciancio, Michael Walter, Fast lattice po int enumeration with minimal overhead, in: SODA, pp · 2015

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2019 1

verdicts

UNVERDICTED 1

representative citing papers

Approximate Voronoi cells for lattices, revisited

cs.DS · 2019-07-10 · unverdicted · novelty 8.0

Determines exact asymptotics for approximate Voronoi cell volumes, yielding improved CVPP complexity bounds with subexponential memory and continuous advice-query trade-offs.

citing papers explorer

Showing 1 of 1 citing paper.

  • Approximate Voronoi cells for lattices, revisited cs.DS · 2019-07-10 · unverdicted · none · ref 27

    Determines exact asymptotics for approximate Voronoi cell volumes, yielding improved CVPP complexity bounds with subexponential memory and continuous advice-query trade-offs.