Note on shortest and nearest lattice vectors

DOI10.1016/S0020-0190(97)00019-7zbMATH Open1336.68263OpenAlexW2096355888MaRDI QIDQ286988FDOQ286988

Authors: 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

Recommendations

• A relation of primal--dual lattices and the complexity of shortest lattice vector problem
• scientific article; zbMATH DE number 1775383
• scientific article; zbMATH DE number 3908520
• Sampling methods for shortest vectors, closest vectors and successive minima
• scientific article; zbMATH DE number 3972987

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)

Cites Work

• Geometric algorithms and combinatorial optimization
• Minkowski's Convex Body Theorem and Integer Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• New bounds in some transference theorems in the geometry of numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• A parametric version of LLL and some consequences: parametric shortest and closest vector problems
• On the unique shortest lattice vector problem
• Approximating the closest vector problem using an approximate shortest vector oracle
• Long shortest vectors in low dimensional lattices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286988)