|
Contact Info | Publications | Course I have taught (webpages)| Talk Slides |
||
|
Sanjeev Arora |
||
A new book: COMPUTATIONAL
COMPLEXITY:A
MODERN
APPROACH. You can find an older draft
and other material here.
A non-majors course I created (and still teach): The
Computational Universe. It satisfies Princeton's
Science and Technology (with Lab) Distribution
requirement.
I am involved with (and was founding director of) the Center
for Computational Intractability.
|
Research Interests: My research area
is Theoretical
Computer Science. Specific topics that I
have worked on: Computational Complexity, Uses
of randomness in computation, Probabilistically
Checkable Proofs (PCPs), Computing Approximate
Solutions to NP-hard problems, Geometric
embeddings of metric spaces, Unique Games
Conjecture, Complexity of Financial Derivatives,
Provable bounds for Machine Learning.
Number of times accessed since April
12 1996: |
||
Current weather:  |
||
