Computational complexity of two pencil puzzles: Kurotto and Juosan (Q2695483): Difference between revisions

@@ 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.1007/978-3-030-90048-9_14
+Normal rank
@@ Property / OpenAlex ID @@
+W3210356593
@@ Property / OpenAlex ID: W3210356593 / rank @@
+Normal rank
@@ Property / cites work @@
+Hashiwokakero is NP-complete
@@ Property / cites work: Hashiwokakero is NP-complete / rank @@
+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 @@
+Q4898148
@@ Property / cites work: Q4898148 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3301014
@@ Property / cites work: Q3301014 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5405470
@@ Property / cites work: Q5405470 / rank @@
+Normal rank