(Q92664)

English

Sanjeev Arora

Theoretical computer scientist

Statements

Sanjeev Arora.jpg
283 × 400; 21 KB
0 references
Sanjeev Arora (English)
0 references
January 1968
1 reference
For contributions to computational complexity, algorithms, and optimization that have helped reshape our understanding of computation (English)
For foundational work on probabilistically checkable proofs and approximate solutions to NP-hard optimization problems (English)
For his dissertation "Probabilistic Checking of Proofs and Hardness of Approximation Problems." (English)
2
0 references

Identifiers

0 references
0 references
 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit