Dual vectors and lower bounds for the nearest lattice point problem

DOI10.1007/BF02122554zbMath0653.10026WikidataQ56959241 ScholiaQ56959241MaRDI QIDQ1107568

Johan T. Håstad

Publication date: 1988

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

latticedual latticelattice basishomogeneous minimum

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Lattice packing and covering (number-theoretic aspects) (11H31) Geometry of numbers (11H99)

Related Items

Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\), Simultaneously good bases of a lattice and its reciprocal lattice, Does the dual-sieve attack on learning with errors even work?, More on average case vs approximation complexity, Structure Versus Hardness Through the Obfuscation Lens, A relation of primal--dual lattices and the complexity of shortest lattice vector problem, On the limits of nonapproximability of lattice problems, A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor, New bounds in some transference theorems in the geometry of numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Minkowski's Convex Body Theorem and Integer Programming