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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2013.11.023 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A46 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A12 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6248967 / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithmic combinatorial game theory
Property / zbMATH Keywords: algorithmic combinatorial game theory / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamiltonian path
Property / zbMATH Keywords: Hamiltonian path / rank
 
Normal rank
Property / zbMATH Keywords
 
mathematical puzzles/games
Property / zbMATH Keywords: mathematical puzzles/games / 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.1016/j.tcs.2013.11.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069939081 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2013.11.023 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:07, 9 December 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