Pages that link to "Item:Q3563937"
From MaRDI portal
The following pages link to Finding the Closest Lattice Point by Iterative Slicing (Q3563937):
Displaying 7 items.
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← links)
- The irreducible vectors of a lattice: some theory and applications (Q2698346) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- Generalizing CGAL Periodic Delaunay Triangulations (Q5874547) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)