Pages that link to "Item:Q4412829"
From MaRDI portal
The following pages link to Memoryless Determinacy of Parity Games (Q4412829):
Displaying 11 items.
- Optimal constructions for active diagnosis (Q314815) (← links)
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Refinement modal logic (Q476194) (← links)
- Memoryless determinacy of finite parity games: another simple proof (Q1705645) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- The maker-breaker largest connected subgraph game (Q2680987) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- Fatal Attractors in Parity Games (Q4910410) (← links)
- Polynomial-Time Under-Approximation of Winning Regions in Parity Games (Q4982057) (← links)
- Foundations of Software Science and Computation Structures (Q5899098) (← links)
- (Q6134270) (← links)