Sanjeev Arora
Princeton University
See Author Page in Digital Library
Citation

For foundational work on probabilistically checkable proofs and approximate solutions to NP-hard optimization problems.



[Fellows]   [Awards]