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 M 2( Z) in polynomial time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
