Short vectors of planar lattices via continued fractions
type: Item
instance of: scholarly article
title: Short vectors of planar lattices via continued fractions
zbMATH Open document ID: 1032.68138
DOI: 10.1016/S0020-0190(00)00186-1
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1767343
zbMATH Keywords: Algorithms
zbMATH Keywords: Computational geometry
zbMATH Keywords: Number theoretic algorithms
author: Friedrich Eisenbrand
MaRDI profile type: Publication
cites work: On the computational power of pushdown automata
cites work: Q4888749
cites work: An application of simultaneous diophantine approximation in combinatorial optimization
cites work: Geometric algorithms and combinatorial optimization
cites work: Q5727752
cites work: Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
cites work: Q4385516
cites work: Factoring polynomials with rational coefficients
cites work: Integer Programming with a Fixed Number of Variables
cites work: Finding a shortest vector in a two-dimensional lattice modulo m
cites work: Fast computation of continued fraction expansions.
cites work: Q4237380
cites work: Q3818127
cites work: Q4230368
full work available at URL: s0020-0190(00)00186-1
OpenAlex ID: W2117232375
description: scientific article; zbMATH DE number 1767343