๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Note on shortest and nearest lattice vectors

โœ Scribed by Martin Henk


Book ID
104137357
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
450 KB
Volume
61
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis


We show that with respect to a certain class of norms the so-called shortest lattice vector problem is polynomial-time Turing (Cook) reducible to the nearest lattice vector problem. This gives a little more insight in the relationship of these two fundamental problems in the computational geometry of numbers. @ 1997 Elsevier Science B.V.


๐Ÿ“œ SIMILAR VOLUMES