Pages that link to "Item:Q5492884"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2005 (Q5492884):
Displaying 23 items.
- Complexity and monotonicity results for domination games (Q266262) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- The complexity of stochastic Müller games (Q418128) (← links)
- Assume-admissible synthesis (Q520340) (← links)
- On Müller context-free grammars (Q764314) (← links)
- Games with winning conditions of high Borel complexity (Q817850) (← links)
- Games, complexity classes, and approximation algorithms. (Q1126837) (← links)
- Predictive Complexity for Games with Finite Outcome Spaces (Q2805719) (← links)
- (Q2949122) (← links)
- ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES (Q3021974) (← links)
- Extracting Winning Strategies in Update Games (Q3091450) (← links)
- Restricted Power - Computational Complexity Results for Strategic Defense Games (Q3305735) (← links)
- Decision Problems for Nash Equilibria in Stochastic Games (Q3644770) (← links)
- (Q5009445) (← links)
- Complexity of Unordered CNF Games (Q5053069) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- On the complexity of problems on simple games (Q5388151) (← links)
- On Reachability Games of Ordinal Length (Q5448648) (← links)
- Stochastic Müller Games are PSPACE-Complete (Q5458855) (← links)
- Automata, Languages and Programming (Q5466545) (← links)
- The complexity of recursion theoretic games (Q5694972) (← links)
- Symbolic solution of Emerson-Lei games for reactive synthesis (Q6629450) (← links)
- Checking history-determinism is NP-hard for parity automata (Q6629459) (← links)
