𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lattice basis reduction for indefinite forms and an application

✍ Scribed by Gábor Ivanyos; Ágnes Szántó

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
615 KB
Volume
153
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 application, we present an algorithm, which finds zero divisors in rings isomorphic to M2(Z) in polynomial time.

📜 SIMILAR VOLUMES

Reduction method for concept lattices ba
Reduction method for concept lattices based on rough set theory and its application
✍ Min Liu; Mingwen Shao; Wenxiu Zhang; Cheng Wu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 625 KB

Rough set theory and formal concept analysis are two complementary mathematical tools for data analysis. In this paper, we study the reduction of the concept lattices based on rough set theory and propose two kinds of reduction methods for the above concept lattices. First, we present the sufficient

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

An 8 parameter representation of SU(3) m
An 8 parameter representation of SU(3) matrices and its application for simulating lattice qcd
✍ B Bunk; R Sommer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 325 KB

We present a representation of SU(3) matrices by 8 real parameters. By truncating each parameter to 8 bits we are able to code each SU(3) link variable in one (64 bit) word of memory which reduces the amount of storage space needed by a factor of at least 6. A ten hit Metropolis program using this s

Measuring willingness-to-pay for risk re
Measuring willingness-to-pay for risk reduction: an application of conjoint analysis
✍ Harry Telser; Peter Zweifel 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract This study applies conjoint analysis (CA) to estimate the marginal willingness‐to‐pay (MWTP) of elderly individuals for a reduction of the risk of fracture of the femur. The good in question is a hypothetical hip protector which lowers the risk of a fracture by different amounts. Other