On the complexity of computing winning strategies for finite poset games (Q537910): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Chomp3Rows / rank | |||
Normal rank | |||
Revision as of 18:07, 29 February 2024
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
finite games
0 references
posets
0 references
PSPACE
0 references
proof complexity
0 references
