Sanjeev Arora

Sanjeev Arora

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.

Back to all authors

Books Authored by Sanjeev Arora

Complexity Theory: A Modern Approach

Post date: 21 Oct 2006
A draft of a textbook on computational complexity theory. Covers basic complexity classes, lowerbounds for concrete computational models, and some advanced topics.
Publisher: Cambridge University Press
Publication date: 20 Apr 2009
Document Type: Textbook
 
Complexity Theory: A Modern Approach

Complexity Theory: A Modern Approach

Post date: 21 Oct 2006
A draft of a textbook on computational complexity theory. Covers basic complexity classes, lowerbounds for concrete computational models, and some advanced topics.
Publisher: Cambridge University Press
Publication date: 20 Apr 2009
Document Type: Textbook


Book Categories
Sponsors
Icons8, a free icon pack