The following pages link to (Q4418690):
Displaying 27 items.
- Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
- Alternating traps in Muller and parity games (Q389948) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- Solving parity games by a reduction to SAT (Q414902) (← links)
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- Violator spaces: Structure and algorithms (Q943850) (← links)
- Cyclic games and linear programming (Q944703) (← links)
- Parity game reductions (Q1656552) (← links)
- New deterministic algorithms for solving parity games (Q1756345) (← links)
- Memoryless determinacy of parity and mean payoff games: a simple proof (Q1884982) (← links)
- Robust worst cases for parity games algorithms (Q2182730) (← links)
- A randomized subexponential algorithm for parity games (Q2765924) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- (Q2949135) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- Recursive algorithm for parity games requires exponential time (Q3117548) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- (Q3384167) (← links)
- A Deterministic Subexponential Algorithm for Solving Parity Games (Q3395043) (← links)
- Removing degeneracy may require unbounded dimension increase (Q3503459) (← links)
- A CSP-Based Approach for Solving Parity Game (Q3507327) (← links)
- Solving μ-Calculus Parity Games by Symbolic Planning (Q3614877) (← links)
- Algorithms for Parity Games (Q4412830) (← links)
