On the complexity of computing winning strategies for finite poset games (Q537910)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of computing winning strategies for finite poset games |
scientific article; zbMATH DE number 5898929
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing winning strategies for finite poset games |
scientific article; zbMATH DE number 5898929 |
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
0.92636436
0 references
0 references
0.9032507
0 references
0.9025017
0 references
0.89703107
0 references
0.8920652
0 references
0.8920652
0 references
0 references
