First Page | Document Content | |
---|---|---|
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 WebsiteFile Size: 47,80 KBShare Document on Facebook |
Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.DocID: 1rgOi - View Document | |
SelectNet_Manual_v2_April_2012.pdfDocID: 1qMoc - View Document | |
WV Public Employees Insurance Agency Frequently Asked Questions on Picking a Primary Care Provider Q. Why is PEIA making me pick a physician?DocID: 1qjEP - View Document | |
Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192.DocID: 1oP1q - View Document | |
Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004DocID: 1mroB - View Document |