Pages that link to "Item:Q1107568"
From MaRDI portal
The following pages link to Dual vectors and lower bounds for the nearest lattice point problem (Q1107568):
Displaying 15 items.
- More on average case vs approximation complexity (Q430823) (← links)
- Nearest lattice point algorithms on semi \(k\)-reduced basis (Q866044) (← links)
- A best lower bound for good lattice points (Q1092103) (← links)
- Simultaneously good bases of a lattice and its reciprocal lattice (Q1119682) (← links)
- Sur un problème de dualité lié aux sphères en géométrie des nombres. (On a duality problem related to spheres in geometry of numbers) (Q1123225) (← links)
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
- New bounds in some transference theorems in the geometry of numbers (Q1318081) (← links)
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\) (Q1346139) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Efficient computation of dual space and directional multiplicity of an isolated point (Q1634816) (← links)
- The closest vector problem in tensored root lattices of type A and in their duals (Q1692156) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- Stable and well-rounded lattices in diagonal orbits (Q2279941) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (Q5288735) (← links)
