Sciweavers

2 search results - page 1 / 1
» Time-Optimal Winning Strategies for Poset Games
Sort
View
MST
2011
237views Hardware» more  MST 2011»
12 years 11 months ago
On the Complexity of Computing Winning Strategies for Finite Poset Games
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
Michael Soltys, Craig Wilson