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

Document Date: 2012-02-10 07:43:15


Open Document

File Size: 338,83 KB

Share Result on Facebook
UPDATE