This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Babai: On Lovász lattice reduction and the nearest lattice point problem. Proc. of STACS '85, Springer Lecture Notes in Computer Science 182 (1985), 13–20.
G. Bergman: Notes on Ferguson and Forcade's generalized euclidean algorithm. Preprint, Dept. of Mathematics, Univ. of California, Berkeley (1980).
L. Bernstein: The Jacobi-Perron algorithm. Springer Lecture Notes in Mathematics 207 (1971).
A. J. Brentjes: Multidimensional continued fraction algorithms. Math. Centre Tracts 155, Amsterdam (1982).
J. W. S. Cassels: An Introduction to the Geometry of Numbers. 2nd edition, Springer, Berlin (1971).
H. Ferguson and R. Forcade: Generalization of the euclidean algorithm for real numbers to all dimensions higher than two. Bull. Amer. Math. Soc. 1, 6 (1979), 912–914.
Ferguson and R. Forcade: Multidimensional euclidean algorithms. J. Reine Angew. Math. 334 (1982), 171–181.
A. M. Frieze, J. Hastad, R. Kannan, J. Lagarias and A. Shamir: Linear congruential generators do not produce random sequences. Siam. J. Computing (to appear).
C. F. Gauss: Disquisitiones Arithmeticae. Leipzig (1801). Deutsche Übersetzung, Springer, Berlin (1889).
P. M. Gruber and C. G. Lekkerkeker: Geometry of Numbers. 2nd edition, North-Holland, Amsterdam-New York (1987).
J. Hastad, B. Just, J. Lagarias and C. P. Schnorr: Polynomial time algorithms for finding integer relations among real numbers. Preliminary version in Proc. of STACS '86, Springer Lecture Notes in Computer Science 210 (1986), 105–118. Full paper to appear in Siam. J. Comput.
B. Helfrich: Algorithms to construct Minkowski reduced and Hermite reduced lattice bases. Theor. Comp. Sci. 41 (1985), 125–139.
C. G. J. Jacobi: Allgemeine Theorie der Kettenbruchähnlichen Algorithmen. J. Reine Angew. Math. 69 (1868), 29–64.
R. Kannan: Minkowski's convex body theorem and integer programming. Mathematics of Operations Research 12 (1987), 415–440.
A. Korkine and G. Zolotareff: Sur les formes quadratiques. Math. Ann. 6 (1873), 366–398.
J. Lagarias and A. M. Odlyzko: Solving low density subset sum problems. 24th Ann. Symp. of Foundation of Comp. Sci. (1983), 1–10.
J. Lagarias, H. W. Lenstra, Jr., and C. P. Schnorr: Korkine-Zolotareff bases and successive minima of a lattice and its reciprocal lattice. To appear in Combinatorica (1987).
A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász: Factoring polynomials with rational coefficients. Math. Ann. 261 (1982), 513–534.
H. W. Lenstra, Jr.: Integer programming with a fixed number of variables. Mathematics of Operations Research 8 (1983), 538–548.
H. Minkowski: Geometrie der Zahlen. Teubner, Leipzig (1910).
O. Perron: Grundlage für eine Theorie des Jacobischen Kettenbruchalgorithmus. Math. Ann. 64 (1907), 1–76.
C. P. Schnorr: A hierarchy of polynomial time lattice basis reduction algorithms. To appear in Theor. Comp. Sci. (1987).
C. P. Schnorr: A more efficient lattice reduction algorithm. To appear in J. Algorithms (1987).
A. Schönhage: Factorization of univariate integer polynomials by diophantine approximation and by an improved basis reduction algorithm. Proc. of 11th ICALP. Springer Lecture Notes in Computer Science 172 (1984), 436–447.
G. Szekeres: Multidimensional continued fraction algorithms. Ann. Univ. Sci. Budapest, Eötvös Sect. Math. 13 (1970), 113–140.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schnorr, C.P. (1988). Geometry of numbers and integer programming. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035826
Download citation
DOI: https://doi.org/10.1007/BFb0035826
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18834-6
Online ISBN: 978-3-540-48190-4
eBook Packages: Springer Book Archive