Abstract
We reduce in polynomial time various computational problems concerning integer lattices to the case that the lattice L is defined by a single modular (linear, homogeneous) equation, L = {x∈ℤn : 〈x,v〉=0 mod d} where v is a vector in ℤn and d an integer. An integer lattice L ⊂ ℤn can be written in this form if and only if L has rank n and if the abelian group ℤn/L is cyclic. The shortest vector problem, the problem to compute the successive minima of a lattice and the problem to reduce (in the sense of Minkowski or in the sense of Korkine, Zolotareff) a lattice basis is transformed in polynomial time to lattices of the above special form. Our method shows that every integer lattice can be approximated efficiently by rational lattices L ⊂ 1/k ℤn such that the abelian group ℤn/kL is cyclic.
Preview
Unable to display preview. Download preview PDF.
References
P.D. DOMICH, R. KANNAN and L.E. TROTTER, Jr.: Hermite normal form computation using modulo determinant arithmetic. CORE discussion paper No. 8507, Université catholique de Louvain (1985).
P. van EMDE BOAS: Another NP-complete partition problem and the complexity of computing short vectors in a lattice. Math. Dept. Report 81-O4, Univ. Amsterdam, April 1981.
M. KAMINSKI and A. PAZ: Computing the Hermite normal form of an integral matrix. Technical report # 417, Technion, Department of Computer Science, (1986).
R. KANNAN: Improved algorithms on integer programming and related lattice problems. Proc. 15th Annual ACM Symp. on Theory of Computing (1983), 193–206.
R. KANNAN and A. BACHEM: Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. Siam Journal of Computing 9, (1979), 499–507.
A. KORKINE and G. ZOLOTAREFF: Sur les formes quadratiques Math. Ann. 6 (1873), 366–389.
J.C. LAGARIAS, H.W. LENSTRA, Jr. and C.P. SCHNORR: Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal, (1986). Submitted for publication.
A.K. LENSTRA, H.W. LENSTRA, Jr. and L. LOVÁSZ: Factoring polynomials with rational coefficients. Mathematische Annalen 261 (1982), 513–534.
H.W. LENSTRA, Jr.: Integer programming in a fixed number of variables. Math. Op. Res. 8 (1983), 538–548.
C.P. SCHNORR: A hierarchy of polynomial time lattice bases reduction algorithms (1986). To appear in Theoretical Computer Science.
C.P. SCHNORR: A more efficient algorithm for lattice basis reduction. To appear in Journal of Algorithms. Preprint in Lecture Notes in Computer Sciences, 226, (1986) 359–369.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paz, A., Schnorr, C.P. (1987). Approximating integer lattices by lattices with cyclic factor groups. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_33
Download citation
DOI: https://doi.org/10.1007/3-540-18088-5_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18088-3
Online ISBN: 978-3-540-47747-1
eBook Packages: Springer Book Archive