First Page | Document Content | |
---|---|---|
Date: 2007-12-18 10:38:02Probabilistic complexity theory Computability theory Post correspondence problem Probabilistically checkable proof PCP Applied mathematics Mathematics Theoretical computer science Mathematical proofs Theory of computation | Microsoft Word - AG7-ButterfliesAdd to Reading ListSource URL: cs.bath.ac.ukDownload Document from Source WebsiteFile Size: 111,38 KBShare Document on Facebook |
Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014DocID: 1rrqu - View Document | |
Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.DocID: 1rgOi - View Document | |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1rgbF - View Document | |
Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN ByDocID: 1rdMz - View Document | |
Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995DocID: 1raDV - View Document |