The following pages link to Solving parity games in big steps (Q340584):
Displaying 14 items.
- Solving parity games by a reduction to SAT (Q414902) (← links)
- Parity game reductions (Q1656552) (← links)
- Automata on infinite trees (Q2074210) (← links)
- Robust worst cases for parity games algorithms (Q2182730) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- (Q5079761) (← links)
- Büchi Good-for-Games Automata Are Efficiently Recognizable (Q5090951) (← links)
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
- Solving Parity Games on the GPU (Q5166708) (← links)
- (Q5232902) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431341) (← links)
- Synthesizing Computable Functions from Rational Specifications Over Infinite Words (Q6195088) (← links)
- Priority promotion with Parysian flair (Q6627044) (← links)