Short vectors of planar lattices via continued fractions

DOI10.1016/S0020-0190(00)00186-1zbMath1032.68138OpenAlexW2117232375MaRDI QIDQ1603456

Friedrich Eisenbrand

Publication date: 14 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00186-1

zbMATH Keywords

AlgorithmsComputational geometryNumber theoretic algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Bounds for the traveling salesman paths of two-dimensional modular lattices ⋮ A linear algorithm for integer programming in the plane

Cites Work

• An application of simultaneous diophantine approximation in combinatorial optimization
• Factoring polynomials with rational coefficients
• Geometric algorithms and combinatorial optimization
• Finding a shortest vector in a two-dimensional lattice modulo m
• On the computational power of pushdown automata
• Fast computation of continued fraction expansions.
• Integer Programming with a Fixed Number of Variables
• Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Short vectors of planar lattices via continued fractions