| Leslie Valiant |
Article Index for Leslie |
Website Links For Leslie |
Information AboutLeslie Valiant |
|
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-Complete ness 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 at the International Congress Of Mathematicians in 1986 and the Knuth Award in 1997 . He is a Fellow of the Royal Society (London) 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 ). |
|
|