An Influential Theoretician.
The article announces that the computer scientist Sanjeev Arora has been awarded the 2011 ACM-Infosys Award and discusses his research on computational complexity and the PCP Theorem, optimization, and algorithms.
| Publicado en: | Communications of the ACM Vol. 55; no. 6; pp. 24 - 25 |
|---|---|
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Jun2012
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| Sumario: | The article announces that the computer scientist Sanjeev Arora has been awarded the 2011 ACM-Infosys Award and discusses his research on computational complexity and the PCP Theorem, optimization, and algorithms. |
|---|