Pages that link to "Item:Q3540190"
From MaRDI portal
The following pages link to The Descriptive Complexity of Parity Games (Q3540190):
Displaying 12 items.
- Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
- The Rabin index of parity games: its complexity and approximation (Q897647) (← links)
- Game logic is strong enough for parity games (Q1425188) (← links)
- Fixed-point logics and solitaire games (Q1764420) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- Quasipolynomial computation of nested fixpoints (Q2044189) (← links)
- Cooking Your Own Parity Game Preorders Through Matching Plays (Q3177339) (← links)
- (Q3384164) (← links)
- (Q3384876) (← links)
- A New Pebble Game that Characterizes Parallel Complexity Classes (Q3835026) (← links)
- Defining Winning Strategies in Fixed-Point Logic (Q4635818) (← links)
- (Q5114824) (← links)