Sanjeev Arora is Charles C. Fitzmorris Professor of Computer Science at Princeton University. His research area is Theoretical Computer Science. He has worked on Computational Complexity, Probabilistically Checkable Proofs (PCPs), computing approximate solutions to NP-hard problems, geometric embedding of metric spaces, unique games conjecture, complexity of financial derivatives, and provable bounds for Machine Learning.
Books Authored by Sanjeev Arora
Complexity Theory: A Modern Approach
Post date: 21 Oct 2006Complexity Theory: A Modern Approach
Post date: 21 Oct 2006