On the complexity of computing winning strategies for finite poset games (Q537910): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91A05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5898929 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
finite games | |||
Property / zbMATH Keywords: finite games / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
posets | |||
Property / zbMATH Keywords: posets / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
PSPACE | |||
Property / zbMATH Keywords: PSPACE / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
proof complexity | |||
Property / zbMATH Keywords: proof complexity / rank | |||
Normal rank |
Revision as of 09:29, 1 July 2023
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