On the Complexity of Computing Winning Strategies for Finite Poset Games

Michael Soltys, Craig Wilson. On the Complexity of Computing Winning Strategies for Finite Poset Games. Theory Comput. Syst., 48(3):680-692, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.