The Complexity of Poset Games (Q5084701): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.7155/jgaa.00578 / rank
Normal rank
 
Property / author
 
Property / author: Stephen A. Fenner / rank
Normal rank
 
Property / author
 
Property / author: Thomas Thierauf / rank
Normal rank
 
Property / author
 
Property / author: Stephen A. Fenner / rank
 
Normal rank
Property / author
 
Property / author: Thomas Thierauf / 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.7155/jgaa.00578 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205237161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2703803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4827118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4831470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results and questions in combinatorial game complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity, appeal and challenges of combinatorial games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deletion game on hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Curious Nim-Type Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nim-type games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flipping the winner of a poset game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A vertex and edge deletion game on graphs / 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: On the complexity of computing winning strategies for finite poset games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5761283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete analysis of von Neumann's Hackendot / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7155/JGAA.00578 / rank
 
Normal rank

Latest revision as of 15:52, 30 December 2024

scientific article; zbMATH DE number 7549457
Language Label Description Also known as
English
The Complexity of Poset Games
scientific article; zbMATH DE number 7549457

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references