First Page | Document Content | |
---|---|---|
Date: 2014-04-12 08:04:57Theoretical computer science Lance Fortnow Probabilistic complexity theory Carsten Lund Computer science IP BPP Probabilistically checkable proof Symposium on Foundations of Computer Science Mathematics | Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.Add to Reading ListSource URL: people.cs.uchicago.eduDownload Document from Source WebsiteFile Size: 94,00 KBShare Document on Facebook |