The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions (Q3540099): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-88282-4_9
+Normal rank
@@ Property / OpenAlex ID @@
+W2951459406
@@ Property / OpenAlex ID: W2951459406 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem
+Normal rank
@@ Property / cites work @@
+The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4128417
@@ Property / cites work: Q4128417 / rank @@
+Normal rank
@@ Property / cites work @@
+Domino Games and Complexity
@@ Property / cites work: Domino Games and Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable
+Normal rank
@@ Property / cites work @@
+Planar Crossovers
@@ Property / cites work: Planar Crossovers / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets (and some facets of complexity)
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank