Leslie Valiant
From Wikipedia, the free encyclopedia
Leslie Valiant (born 28 March 1949) is a British computer scientist and computational theorist.
He was educated at King's College, Cambridge, Imperial College London, and Warwick University where he received his Ph.D. in computer science in 1974. He started teaching at Harvard University in 1982 and is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics in the Division of Engineering and Applied Sciences. Prior to 1982 he taught at Carnegie Mellon University, Leeds University, and the University of Edinburgh.
Valiant is world-renowned for his work in theoretical computer science. Among his many contributions to complexity theory, he introduced the notion of Sharp-P-completeness to explain why enumeration and reliability problems are intractable. He also introduced the "probably approximately correct" (PAC) model of machine learning that has helped the field of computational learning theory grow. He also works in computational neuroscience focusing on understanding memory and learning.
He received the Nevanlinna Prize in 1986 and the Knuth Prize in 1997. He is a Fellow of the Royal Society (London), a Fellow of the American Association for Artificial Intelligence, and a member of the National Academy of Sciences (USA).
One of his significant research papers was proving, along with Vijay Vazirani, UNIQUE-SAT ∈ P → NP=RP (Valiant-Vazirani Theorem).
[edit] External link
- Home page (Including photograph)
 This article about a British scientist is a stub. You can help Wikipedia by expanding it. |
Categories: 1949 births | British computer scientists | British Jews | Jewish scientists | Alumni of Imperial College London | Fellows of the Royal Society | Fellows of the American Association for Artificial Intelligence | Members and associates of the United States National Academy of Sciences | Knuth Prize laureates | Living people | Erdős number 3 | British scientist stubs | United Kingdom computer specialist stubs
