H. W. Lenstra, Jr. for using the geometry of numbers to solve integer programs with few variables in time polynomial in the number of constraints.
Toomas Hendrik Ilves | Hendrik Tollens | Hendrik Lorentz | Hendrik Conscience | Hendrik Casimir | Jan Karel Lenstra | Jan Hendrik van Kinsbergen | Hendrik Verwoerd | Hendrik Van Riessen | Hendrik Lenstra | Hendrik Andriessen | Tony Hendrik | Jacobus Hendrik Pierneef | Hendrik Poinar | Hendrik Dreekmann | Hendrik de Meijer | George Hendrik Breitner | David Hendrik Chassé | Theodoor Hendrik van de Velde | Lenstra–Lenstra–Lovász lattice basis reduction algorithm | Joseph Petrus Hendrik Crowe | Johan Hendrik Weidner | Hendrik Willem Van Loon | Hendrik Willem van Loon | Hendrik Voogd | Hendrik van Rheede | Hendrik Tonneboeijer | Hendrik Timmer | Hendrik Spilman | Hendrik Nicolaas Werkman |
Lenstra showed that a cyclic group does not have a generic polynomial if n is divisible by eight, and Smith explicitly constructs such a polynomial in case n is not divisible by eight.
His thesis, titled Cyclotomy of rings and primality testing, was written under the direction of Erwin Engeler and Hendrik Lenstra.