![Probabilistic complexity theory / Theoretical computer science / Morphisms / Computational complexity theory / PCP theorem / Mathematical optimization / Probabilistically checkable proof / Combinatorica / IP / Algorithm / Russell Impagliazzo / Graph isomorphism Probabilistic complexity theory / Theoretical computer science / Morphisms / Computational complexity theory / PCP theorem / Mathematical optimization / Probabilistically checkable proof / Combinatorica / IP / Algorithm / Russell Impagliazzo / Graph isomorphism](https://www.pdfsearch.io/img/923d71dde65856ae65ca9056e5708d68.jpg) Date: 2015-05-26 18:25:25Probabilistic complexity theory Theoretical computer science Morphisms Computational complexity theory PCP theorem Mathematical optimization Probabilistically checkable proof Combinatorica IP Algorithm Russell Impagliazzo Graph isomorphism | | 2015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including algAdd to Reading ListSource URL: www.sigact.orgDownload Document from Source Website File Size: 47,80 KBShare Document on Facebook
|