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

@@ Property / DOI @@
-.1016/j.tcs.2013.11.023
@@ Property / DOI: 10.1016/j.tcs.2013.11.023 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2013.11.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2069939081
@@ Property / OpenAlex ID: W2069939081 / rank @@
+Normal rank
@@ Property / cites work @@
+The edge Hamiltonian path problem is NP-complete
@@ Property / cites work: The edge Hamiltonian path problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4779132
@@ Property / cites work: Q4779132 / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Problem Which Is Complete in Polynomial Space
+Normal rank
@@ Property / cites work @@
+Undirected edge geography
@@ Property / cites work: Undirected edge geography / rank @@
+Normal rank
@@ Property / cites work @@
+Q3023366
@@ Property / cites work: Q3023366 / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3395518
@@ Property / cites work: Q3395518 / rank @@
+Normal rank
@@ Property / cites work @@
+The edge Hamiltonian path problem is NP-complete for bipartite graphs
+Normal rank
@@ Property / cites work @@
+GO Is Polynomial-Space Hard
@@ Property / cites work: GO Is Polynomial-Space Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4163005
@@ Property / cites work: Q4163005 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of some two-person perfect-information games
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2013.11.023
@@ Property / DOI: 10.1016/J.TCS.2013.11.023 / rank @@
+Normal rank