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

From MaRDI portal
← Older editNewer edit →
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Bots
1,984,406 edits
‎Changed an Item
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

Revision as of 11:18, 29 July 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

    title
    The Complexity of Poset Games (English)
    0 references
    author
    Daniel Grier
    0 references
    Rohit Gurjar
    0 references
    Arpita Korwar
    0 references
    Stephen A. Fenner
    0 references
    Thomas Thierauf
    0 references
    publication date
    28 June 2022
    0 references

    Identifiers

    DOI
    10.7155/jgaa.00578
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    06A07
    0 references
    91A05
    0 references
    91A68
    0 references
    zbMATH DE Number
    7549457
    0 references
    OpenAlex ID
    W4205237161
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5084701&oldid=36823867"
    Powered by MediaWiki