The following pages link to (Q3984859):
Displaying 9 items.
- On the complexity of computing winning strategies for finite poset games (Q537910) (← links)
- Games with uniqueness properties (Q705062) (← links)
- Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game (Q725767) (← links)
- Computational complexity of winning strategies in two-person polynomial games (Q1190954) (← links)
- Recursively presented games and strategies (Q1196205) (← links)
- Complexities of winning strategies in diophantine games (Q1908042) (← links)
- Polynomial games and determinacy (Q1919550) (← links)
- On the coefficient-choosing game (Q2235355) (← links)
- Multivision: An Intractable Impartial Game with a Linear Winning Strategy (Q2757323) (← links)