UNO is hard, even for a single player (Q389942): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The edge Hamiltonian path problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779132 / 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: Undirected edge geography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3023366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge Hamiltonian path problem is NP-complete for bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: GO Is Polynomial-Space Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4163005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank

Latest revision as of 06:00, 7 July 2024

scientific article
Language Label Description Also known as
English
UNO is hard, even for a single player
scientific article

    Statements

    UNO is hard, even for a single player (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2014
    0 references
    algorithmic combinatorial game theory
    0 references
    dynamic programming
    0 references
    Hamiltonian path
    0 references
    mathematical puzzles/games
    0 references

    Identifiers

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