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 |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=76246872&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 76246872 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Jun2012 vid: 55 iid: 6 pid: 68 pub: Association for Computing Machinery artinfo: ui: 76246872 10.1145/2184319.2184328 ppf: 24 ppct: 1 formats: tig: atl: An Influential Theoretician. aug: su: Arora, Sanjeev Computational complexity Computer science awards Awards sug: subj: Arora, Sanjeev Computational complexity Computer science awards Awards ab: 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. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2012 holdings: @attributes: islocal: N |
|---|