<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-12-12 06:04:13NP-complete problems Combinatorial optimization Graph coloring Probabilistic complexity theory Algorithms Semidefinite programming Randomized algorithm Approximation algorithm Randomized rounding Theoretical computer science Mathematics Applied mathematics |
Add to Reading List |
Approximation Algorithms (ADM III) | 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 |