
معرفی
Russell Impagliazzo is a Professor in the Department of Computer Science and Engineering at the Jacobs School of Engineering, University of California, San Diego, where he conducts foundational research in theoretical computer science.
His work centers on Cryptography and Computational Complexity, with seminal contributions including the equivalence proof between one-way functions and pseudorandom generators, the framework of cryptographic "worlds" demonstrating strict inequivalence of primitives (e.g., one-way functions without public-key encryption), and the exponential-time hypothesis (ETH) characterizing problems resisting brute-force speedups. His collaboration with Avi Wigderson established critical links between circuit lower bounds and derandomization, showing that exponential circuit complexity for EXP problems implies P = BPP.
Impagliazzo's research trends emphasize structural relationships in complexity classes and cryptographic feasibility, with subfields spanning average-case hardness, pseudorandomness, and fine-grained complexity. His theoretical frameworks remain highly influential in advancing computational hardness assumptions.
Russell Impagliazzo در جاهای دیگر
جستجوهای مرتبط
شاید اینها هم به کارتان بیاید
Russell ImpagliazzoUniversity of California, Berkeley · استاد- AAvi WigdersonUniversity of Novi Sad · استاد
Shuichi HiraharaMax Planck Institute for Software Systems · دانشیار
Chethan KamathIndian Institute of Technology Bombay (IITB) · استادیار- GGeorge S. TolomiczenkoCalifornia Institute of Technology (Caltech) · استاد
- PPamela BjorkmanCalifornia Institute of Technology (Caltech) · استاد