Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of stochastic games
Information and Computation
The complexity of mean payoff games on graphs
Theoretical Computer Science
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Practical Model-Checking Using Games
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Discrete Applied Mathematics
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Solving parity games in big steps
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
| Hi-index | 0.04 |
This paper presents a superpolynomial lower bound for the recently proposed snare memorization non-oblivious strategy iteration algorithm due to Fearnley. Snare memorization is a method to train strategy iteration techniques to remember certain profitable substrategies and reapply them again. We show that there is not much hope to find a polynomial-time algorithm for solving parity games by applying such non-oblivious techniques.