Russell Graham Impagliazzo[1] is a professor of computer science at the University of California, San Diego, specializing in computational complexity theory.[2]
Russell Graham Impagliazzo | |
---|---|
Alma mater | Wesleyan University; University of California, Berkeley |
Known for | Results in computational complexity theory |
Scientific career | |
Thesis | Pseudo-random Generators for Probablistic Algorithms and for Cryptography (1992) |
Doctoral advisor | Manuel Blum |
Website | https://cseweb.ucsd.edu//~russell/ |
Impagliazzo received a BA in mathematics from Wesleyan University.[3] He obtained a doctorate from the University of California, Berkeley in 1992. His advisor was Manuel Blum.[1] He joined the faculty of UCSD in 1989,[4] having been a postdoc there from 1989 to 1991.[3]
Impagliazzo's contributions to complexity theory include:
Impagliazzo is well-known for proposing the "five worlds" of computational complexity theory, reflecting possible states of the world around the P versus NP problem.[16]
Understanding which world we live in is still a key motivating question in complexity theory and cryptography.[17]
Impagliazzo has received the following awards: