• Sanjeev Arora
  • Unit: Princeton University - Computer Science
  • Organization: Princeton University
  • Interests: Complexity theory; probabilistically checkable proofs; approximation algorithms; computational uses of randomness.
  • Website