Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Ramsey theory for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4056030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Which Is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pebbling Problem is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Relations and Chromatic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Othello game on an \(n\times n\) board is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: GO Is Polynomial-Space Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph counting identities and Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Playing disjunctive sums is polynomial space complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games against nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gobang is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hex ist Pspace-vollständig. (Hex is Pspace-complete) / 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: Q3433898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Ramsey games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223779 / rank
 
Normal rank

Latest revision as of 10:28, 5 June 2024

scientific article
Language Label Description Also known as
English
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.
scientific article

    Statements

    Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (English)
    0 references
    0 references
    21 January 2003
    0 references
    complexity theory
    0 references
    avoidance games
    0 references
    edge coloring
    0 references
    generalized Ramsey theory
    0 references
    graph Ramsey theory
    0 references
    Sim
    0 references
    PSPACE-completeness
    0 references

    Identifiers

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