On the complexity of computing winning strategies for finite poset games (Q537910)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing winning strategies for finite poset games |
scientific article |
Statements
On the complexity of computing winning strategies for finite poset games (English)
0 references
23 May 2011
0 references
