Pages that link to "Item:Q1392031"
From MaRDI portal
The following pages link to Finding a shortest vector in a two-dimensional lattice modulo m (Q1392031):
Displaying 9 items.
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- An algorithm for finding a shortest vector in a two-dimensional modular lattice (Q1318688) (← links)
- Short vectors of planar lattices via continued fractions (Q1603456) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Bounds for the traveling salesman paths of two-dimensional modular lattices (Q2012892) (← links)
- Shortest Integer Vectors (Q3140530) (← links)
- Farey Sequences and Discrete Radon Transform Projection Angles (Q3438912) (← links)
- Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)
- Point lattices and oscillating recurrence sequences<sup>†</sup> (Q5466744) (← links)