Sanjeev Arora
Top View
- Probabilistic Checking of Proofs: a New Characterization of NP
- Novel Frameworks for Mining Heterogeneous and Dynamic
- Probabilistically Checkable Proofs and Hardness of Approximation
- On the Work of Madhu Sudan: the 2002 Nevalinna Prize Winner 107
- Mathematics and Computation
- References for the “Algorithmic High Dimensional Geometry” Lectures at the Big Data Boot Camp, Simons Institute, Berkeley
- Lec. 7: Low Degree Testing (Part I) Lecturer: Prahladh Harsha Scribe: Nutan Limaye
- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
- Approximation Schemes for NP-Hard Geometric Optimization Problems: a Survey
- Proof Verification and the Hardness of Approximation Problems
- Moses Charikar
- Towards a Study of Low-Complexity Graphs*
- Curriculum Vitae
- IAS Annual Report 2019-20
- PCP Theorem, Hardness of Approximation, And
- John Von Neumann
- To Tackle Profound Questions in Computer Science 20 August 2008