Pages that link to "Item:Q2027268"
From MaRDI portal
The following pages link to Approximate Voronoi cells for lattices, revisited (Q2027268):
Displaying 8 items.
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- Voronoi-like nondeterministic partition of a lattice by collectives of finite automata (Q1596777) (← links)
- Voronoi-like partition of lattice in cellular automata (Q1914936) (← links)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations (Q2875162) (← links)
- Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices (Q3990838) (← links)
- Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations (Q5470949) (← links)