The following pages link to (Q5028462):
Displaying 15 items.
- The Rabin index of parity games: its complexity and approximation (Q897647) (← links)
- A randomized subexponential algorithm for parity games (Q2765924) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- Recursive algorithm for parity games requires exponential time (Q3117548) (← links)
- (Q3384167) (← links)
- A Deterministic Subexponential Algorithm for Solving Parity Games (Q3395043) (← links)
- A CSP-Based Approach for Solving Parity Game (Q3507327) (← links)
- (Q4418690) (← links)
- Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width (Q4927428) (← links)
- Timed Parity Games: Complexity and Robustness (Q5895527) (← links)
- A matrix-based approach to parity games (Q6535384) (← links)
- Guessing winning policies in LTL synthesis by semantic learning (Q6535642) (← links)
- Complexity results for modal logic with recursion via translations and tableaux (Q6597964) (← links)
- Priority promotion with Parysian flair (Q6627044) (← links)
- Parity games on temporal graphs (Q6629452) (← links)