Note on shortest and nearest lattice vectors

DOI10.1016/S0020-0190(97)00019-7zbMath1336.68263OpenAlexW2096355888MaRDI QIDQ286988

Martin Henk

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00019-7

zbMATH Keywords

computational geometrynearest lattice vectorpolar latticeshortest lattice vector

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

A Parametric Version of LLL and Some Consequences: Parametric Shortest and Closest Vector Problems

Cites Work

• Geometric algorithms and combinatorial optimization
• New bounds in some transference theorems in the geometry of numbers
• Minkowski's Convex Body Theorem and Integer Programming
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on shortest and nearest lattice vectors