𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for finding a shortest vector in a two-dimensional modular lattice

✍ Scribed by Mody Lempel; Azaria Paz

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
715 KB
Volume
125
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of finding paths in a
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
✍ Arthur W. Chou; Ker-I Ko πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 2 views

## Abstract The computational complexity of finding a shortest path in a two‐dimensional domain is studied in the Turing machine‐based computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomial‐time computable two‐dimensional do