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

@@ Property / Mathematics Subject Classification ID @@
+A46
@@ Property / Mathematics Subject Classification ID: 91A46 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6715037
@@ Property / zbMATH DE Number: 6715037 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithmic combinatorial game theory
@@ Property / zbMATH Keywords: algorithmic combinatorial game theory / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+solitaire games
@@ Property / zbMATH Keywords: solitaire games / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sorting
@@ Property / zbMATH Keywords: sorting / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2594593206
@@ Property / OpenAlex ID: W2594593206 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01911
@@ Property / arXiv ID: 1603.01911 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3395518
@@ Property / cites work: Q3395518 / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Problem Which Is Complete in Polynomial Space
+Normal rank
@@ Property / cites work @@
+Tetris is Hard, Even to Approximate
@@ Property / cites work: Tetris is Hard, Even to Approximate / rank @@
+Normal rank
@@ Property / cites work @@
+GO Is Polynomial-Space Hard
@@ Property / cites work: GO Is Polynomial-Space Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a perfect strategy for nxn chess requires time exponential in n
+Normal rank
@@ Property / cites work @@
+Q4779132
@@ Property / cites work: Q4779132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2703803
@@ Property / cites work: Q2703803 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Game Theory
@@ Property / cites work: Algorithmic Game Theory / rank @@
+Normal rank
@@ Property / cites work @@
+UNO is hard, even for a single player
@@ Property / cites work: UNO is hard, even for a single player / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of the Game of Set and Its Theoretical Applications
+Normal rank
@@ Property / cites work @@
+How to Make the Perfect Fireworks Display: Two Strategies for<i>Hanabi</i>
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:528493