Leonid Levin
From Wikipedia, the free encyclopedia
| Leonid Anatolievich Levin | |
| Born | November 2, 1948 Dnipropetrovsk, Ukraine |
|---|---|
| Fields | Computer Science |
| Institutions | Boston University |
| Alma mater | Moscow University |
| Doctoral advisor | Andrey Kolmogorov, Albert R. Meyer |
| Known for | NP-completeness |
Leonid Anatolievich Levin (Hebrew: לאוניד אנטולייביץ לוין; Russian: Леонид Анатольевич Левин; born November 2, 1948 in Dnipropetrovsk Ukrainian SSR) is a Russian-American computer scientist best known for his work in defining NP-completeness.
He obtained his master degree in 1970 and first Ph.D. in 1972 at Moscow University where he studied under Andrey Kolmogorov. Later, he emigrated to the U.S. in 1978 and earned another Ph.D. at the Massachusetts Institute of Technology (MIT) in 1979. His advisor at MIT was Albert R. Meyer.
He is well known for his work in randomness in computing, algorithmic complexity and intractability, average-case complexity[1], foundations of mathematics and computer science, algorithmic probability, theory of computation, and information theory.
His life is described in a chapter of the book Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists.[2]
Levin independently discovered a theorem that was also discovered and proven by Stephen Cook. This NP-completeness theorem, often called by inventors' names (see Cook-Levin Theorem) was a basis for one of the seven "Millennium Math. Problems" declared by Clay Mathematics Institute with a $1,000,000 prize offered. It was a breakthrough in computer science and is the foundation of computational complexity. Levin's journal article on this theorem was published in 1973; he had lectured on the ideas in it for some years before that time (see Trakhtenbrot's survey)[3], though complete formal writing of the results took place after Cook's publication.
He is currently a professor of computer science at Boston University, where he began teaching in 1980.
Contents |
[edit] See also
[edit] Notes
- ^ Leonid Levin. Average-case complete problems. SIAM J. Comput., 15:285–286, 1986
- ^ Shasha, Dennis; Cathy Lazere (September 1995). Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists. Springer. ISBN 0-387-97992-1.
- ^ Boris A. Trakhtenbrot (1984). "A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms". Annals of the History of Computing (IEEE) 6 (4): 384–400. doi:. http://csdl.computer.org/comp/mags/an/1984/04/a4384abs.htm.
[edit] References
- "Leonid A. Levin". Mathematics Genealogy Project. http://genealogy.math.ndsu.nodak.edu/id.php?id=69211.
[edit] External links
- Levin's home page at Boston University.
