Past Visiting Professor
Russell Impagliazzo
Erik Ellentuck Fellow
Affiliation
Mathematics
Field of study
Computational Complexity
From
–
Russell Impagliazzo specializes in computational complexity, the role of randomness in computation, proof complexity, average-case complexity, the foundations of cryptography, and the exact complexity of NP-complete problems.
Visits
Visiting Professor
School of Mathematics
–
Visiting Professor
School of Mathematics
–
Visiting Professor
School of Mathematics
–
Visiting Professor
School of Mathematics
–
Visiting Professor
School of Mathematics
–
Member
School of Mathematics
–
Fall
Degrees
University of California - Berkeley
Ph.D.
1991