
Ran Raz
استاد · Computational Complexity Theory
California Institute of Technology (Caltech)United States
معرفی
Ran Raz is a Professor of Theoretical Computer Science at Princeton University. He earned his B.Sc. in Mathematics and Physics (1987) and Ph.D. in Mathematics (1992) from the Hebrew University of Jerusalem. After postdoctoral work at Princeton (1994), he joined the Weizmann Institute of Science in Israel and held visiting positions at Microsoft Research (2006, 2009) and the Institute for Advanced Study (2012–2016).
- Education:
- B.Sc. in Mathematics and Physics, Hebrew University of Jerusalem (1987)
- Ph.D. in Mathematics, Hebrew University of Jerusalem (1992)
- Research Interests:
- Computational Complexity Theory
- Boolean and Arithmetic Circuit Complexity
- Probabilistically Checkable Proofs
- Quantum Computation and Communication
- Randomness and Derandomization
۰مقاله ثبتشده




