On the complexity of computing winning strategies for finite poset games (Q537910): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00224-010-9254-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2168635355 / rank | |||
Normal rank | |||
Revision as of 18:45, 19 March 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
