A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen†

First Page		Document Content
Date: 2012-02-10 07:43:15 Probabilistic complexity theory Randomized algorithm Permutation Structure LP-type problem Mathematics Theoretical computer science Analysis of algorithms		A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen† Add to Reading List Source URL: files.oliverfriedmann.de Download Document from Source Website File Size: 338,83 KB Share Document on Facebook

	Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014 DocID: 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 Coretti DocID: 1rgbF - View Document
	Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN By DocID: 1rdMz - View Document
	Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995 DocID: 1raDV - View Document