The following pages link to (Q5741633):
Displaying 11 items.
- Nearest lattice point algorithms on semi \(k\)-reduced basis (Q866044) (← links)
- The closest vector problem in tensored root lattices of type A and in their duals (Q1692156) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- Covering convex bodies and the closest vector problem (Q2136842) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- Approx-SVP in ideal lattices with pre-processing (Q2292889) (← links)
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
- Voronoi Cells of Lattices with Respect to Arbitrary Norms (Q3174772) (← links)
- Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights (Q5145098) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- Economical convex coverings and applications (Q6583674) (← links)
