On the complexity of deadlock detection in families of planar nets (Q1285587): Difference between revisions

@@ Property / cites work @@
+Q4035682
@@ Property / cites work: Q4035682 / rank @@
+Normal rank
@@ Property / cites work @@
+The undecidability of the domino problem
@@ Property / cites work: The undecidability of the domino problem / rank @@
+Normal rank
@@ Property / cites work @@
+Randomizing Reductions of Search Problems
@@ Property / cites work: Randomizing Reductions of Search Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix Transformation Is Complete for the Average Case
+Normal rank
@@ Property / cites work @@
+A Random NP-complete problem for inversion of 2D cellular automata
+Normal rank
@@ Property / cites work @@
+On the undecidability of deadlock detection in families of nets
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Average case completeness
@@ Property / cites work: Average case completeness / rank @@
+Normal rank
@@ Property / cites work @@
+Average Case Complete Problems
@@ Property / cites work: Average Case Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A linear speed-up theorem for cellular automata
@@ Property / cites work: A linear speed-up theorem for cellular automata / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidability and nonperiodicity for tilings of the plane
+Normal rank
@@ Property / cites work @@
+Simulations between cellular automata on Cayley graphs
+Normal rank