First Page | Document Content | |
---|---|---|
Date: 2002-02-21 20:13:33Computational complexity theory Probabilistic complexity theory Analysis of algorithms Randomized algorithm Communication complexity Factorial Logarithm SL Random self-reducibility Theoretical computer science Mathematics Applied mathematics | The space complexity of approximating the frequency moments Noga Alon † Yossi MatiasAdd to Reading ListSource URL: www.tau.ac.ilDownload Document from Source WebsiteFile Size: 241,12 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 |