View Document Preview and Link Document Date: 2012-02-10 07:43:15 Open Document File Size: 338,83 KB Share Result on Facebook
City Thus / / Country Germany / Israel / / / Facility University of Munich / Tel Aviv University / Aarhus University / / IndustryTerm exponential time algorithms / opiteration algorithms / combinatorial algorithms / iteration algorithm / abstract optimization algorithms / policy iteration algorithm / randomized algorithm / iteration algorithms / deterministic policy iteration algorithm / deterministic algorithm / policy iteration algorithms / Facet algorithm / / Organization School of Computer Science / Carlsberg Foundation / Aarhus University / Department of Computer Science / Tel Aviv University / Center for Algorithmic Game Theory / lin∗ Department of Computer Science / University of Munich / AF (v) / / Person Kalai / Thomas Dueholm Hansen† Uri / Uri Zwick / Ai / / Position faster randomized algorithms player / choosing player 0 strategy / Forward / Player / / ProvinceOrState Newfoundland / / Technology policy iteration algorithms / 3 Policy iteration algorithms / abstract optimization algorithms / Lower bound RandomFacet algorithm / known combinatorial algorithms / exponential time algorithms / deterministic policy iteration algorithm / randomized algorithms / opiteration algorithms / iteration algorithm / deterministic algorithm / 2 algorithm / RandomFacet algorithm / modified algorithm / dom / 4 The Random Facet algorithm The RandomFacet algorithm / policy iteration algorithm / Facet algorithm / Random Facet algorithm / / SocialTag 
A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen†