𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A more efficient algorithm for lattice basis reduction

✍ Scribed by C.P Schnorr

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
763 KB
Volume
9
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

More Efficient Algorithm for Ordered Tre
More Efficient Algorithm for Ordered Tree Inclusion
✍ Weimin Chen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 221 KB

Given two ordered trees S S and T T, the tree inclusion problem is to determine whether it is possible to obtain S S from T T by deleting nodes. Recently, this problem has been recognized as an important primitive in query processing for Ε½< Ε½ .< < <. structured text databases. In this paper we prese

Lattice basis reduction for indefinite f
Lattice basis reduction for indefinite forms and an application
✍ GΓ‘bor Ivanyos; Ágnes SzΓ‘ntΓ³ πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 615 KB

In this paper we present an analogue of the lattice basis reduction algorithm of A.K. Lenstra, H.W. Lenstra and L. Lov~sz for the case of an indefinite non-degenerate symmetric bilinear form. The algorithm produces a reduced basis with similar size properties as in the Euclidean case. As an applicat

An efficient lattice reduction method fo
An efficient lattice reduction method for -linear pseudorandom number generators using Mulders and Storjohann algorithm
✍ Shin Harase πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 241 KB

Recent simulations often use highly parallel machines with many processors, and they need many pseudorandom number generators with distinct parameter sets, and hence we need an effective fast assessment of the generator with a given parameter set. Linear generators over the two-element field are goo