Pages that link to "Item:Q5326586"
From MaRDI portal
The following pages link to Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete (Q5326586):
Displaying 7 items.
- Complexity of the game domination problem (Q313955) (← links)
- Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980) (← links)
- On the complexity of computing winning strategies for finite poset games (Q537910) (← links)
- Flipping the winner of a poset game (Q763499) (← links)
- Pomax games -- a family of integer-valued partizan games played on posets (Q2830437) (← links)
- The Ungar games (Q6548025) (← links)
- Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem (Q6562875) (← links)