Copyright © 1996 Published by Elsevier Science B.V.
Lattice basis reduction for indefinite forms and an application*1
Received 31 August 1993;
revised 27 July 1994.
Available online 29 December 2000.
Abstract
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.
Article Outline
*1 Research partially supported by Hungarian National Foundation for Scientific Research (OTKA), Grants F4116, T14546, T16503, and EC Cooperative Action IC 1000, Algorithms for Future Technologies (ALTEC).






E-mail Article
Add to my Quick Links

Cited By in Scopus (3)

3) leads to a (0, 2)-graph of degree
namely the extended odd graph (or
︀.





