Jan Karel Lenstra [SEP] native language
Jan Karel Lenstra
Jan Karel Lenstra (born 19 December 1947, in Zaandam) is a Dutch mathematician and operations researcher, known for his work on scheduling algorithms, local search, and the travelling salesman problem.
Lenstra received his Ph.D. from the University of Amsterdam in 1976, advised by Gijsbert de Leve. He then became a researcher at the Centrum Wiskunde & Informatica, where he remained until 1989. After taking positions at the Eindhoven University of Technology (where he became Dean of the Faculty of Mathematics and Computer Science
number theory. Lenstra is well known for co-discovering of the Lenstra–Lenstra–Lovász lattice basis reduction algorithm in 1982 and for discovering the elliptic curve factorization method in 1987. In 1992, he computed all solutions to the inverse Fermat equation. The Cohen–Lenstra heuristics is a set of precise conjectures about the structure of class groups of quadratic fields that are partially named after him.
Three of his brothers, Arjen Lenstra, Andries Lenstra, and Jan Karel Lenstra, are also mathematicians. Jan Karel Lenstra is