Pages that link to "Item:Q537910"
From MaRDI portal
The following pages link to On the complexity of computing winning strategies for finite poset games (Q537910):
Displaying 13 items.
- 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)
- Complexities of winning strategies in diophantine games (Q1908042) (← links)
- Sprague-Grundy theory in bounded arithmetic (Q2118177) (← links)
- Winning ways of weighted poset games (Q2373442) (← links)
- Winning an infinite combination of games (Q2902668) (← links)
- Advances in finding ideal play on poset games (Q3390718) (← links)
- (Q3984859) (← links)
- (Q4967182) (← links)
- The Complexity of Poset Games (Q5084701) (← links)
- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete (Q5326586) (← links)
- Relational and Kleene-Algebraic Methods in Computer Science (Q5712441) (← links)
- Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem (Q6562875) (← links)