The following pages link to The Complexity of Poset Games (Q5084701):
Displaying 6 items.
- On the complexity of computing winning strategies for finite poset games (Q537910) (← links)
- Upper bounds on positional Paris-Harrington games (Q2222955) (← links)
- Domino Games and Complexity (Q3495644) (← links)
- (Q4967182) (← links)
- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete (Q5326586) (← links)
- The Game of n-Player Shove and Its Complexity (Q5392650) (← links)