On the complexity of computing winning strategies for finite poset games (Q537910): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Chomp3Rows / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: A Curious Nim-Type Game / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of some two-person perfect-information games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computer Science Logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A complete analysis of von Neumann's Hackendot / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2703803 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4762155 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3221403 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3392275 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three-rowed CHOMP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4530293 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonlinear dynamics in combinatorial games: Renormalizing Chomp / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4831470 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:47, 4 July 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