Back to Results
First PageMeta Content
Theoretical 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 List

Document Date: 2014-04-12 08:04:57


Open Document

File Size: 94,00 KB

Share Result on Facebook