Lenstra–Lenstra–Lovász lattice basis reduction algorithm Summary

Everything you need to understand or teach Lenstra–Lenstra–Lovász lattice basis reduction algorithm.

  • 1 Encyclopedia Article

Study Pack

The Lenstra–Lenstra–Lovász lattice basis reduction algorithm Study Pack contains:

Encyclopedia Articles (1)

349 words, approx. 2 pages
Hendrik W. Lenstra, Jr. 1949- Dutch Mathematician In 1981 Hendrik W. Lenstra, Jr. demonstrated that a certain class of integer programming problems does not exhibit a pattern of exponential growth. Th... Read more