Finding a shortest vector in a two-dimensional lattice modulo m
From MaRDI portal
Publication:1392031
DOI10.1016/S0304-3975(96)00185-5zbMath0903.68083OpenAlexW2127949835MaRDI QIDQ1392031
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00185-5
Related Items
Computing efficiently the lattice width in any dimension, Bounds for the traveling salesman paths of two-dimensional modular lattices, Point lattices and oscillating recurrence sequences†, Efficient Lattice Width Computation in Arbitrary Dimension, Farey Sequences and Discrete Radon Transform Projection Angles, Short vectors of planar lattices via continued fractions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
- An algorithm for finding a shortest vector in a two-dimensional modular lattice
- Fast computation of continued fraction expansions.
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Minkowski's Convex Body Theorem and Integer Programming
- Storage Modification Machines
