Hanabi is NP-hard, even for cheaters who look at their cards (Q528493): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1603.01911 / rank
 
Normal rank

Revision as of 15:53, 18 April 2024

scientific article
Language Label Description Also known as
English
Hanabi is NP-hard, even for cheaters who look at their cards
scientific article

    Statements

    Hanabi is NP-hard, even for cheaters who look at their cards (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2017
    0 references
    algorithmic combinatorial game theory
    0 references
    computational complexity
    0 references
    solitaire games
    0 references
    sorting
    0 references

    Identifiers

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