The complexity of flood filling games (Q692938): Difference between revisions

@@ Property / OpenAlex ID @@
+W2126364564
@@ Property / OpenAlex ID: W2126364564 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4420
@@ Property / arXiv ID: 1001.4420 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic monopolies of constant size
@@ Property / cites work: Dynamic monopolies of constant size / rank @@
+Normal rank
@@ Property / cites work @@
+Q4407717
@@ Property / cites work: Q4407717 / rank @@
+Normal rank
@@ Property / cites work @@
+The density of interfaces: a new first-passage problem
+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 @@
+On time versus size for monotone dynamic monopolies in regular topologies
+Normal rank
@@ Property / cites work @@
+First passage percolation for random colorings of \(\mathbb{Z}^ d\)
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+Drawing borders efficiently
@@ Property / cites work: Drawing borders efficiently / rank @@
+Normal rank
@@ Property / cites work @@
+On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
+Normal rank
@@ Property / cites work @@
+Minesweeper is NP-complete.
@@ Property / cites work: Minesweeper is NP-complete. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4341806
@@ Property / cites work: Q4341806 / rank @@
+Normal rank
@@ Property / cites work @@
+Size bounds for dynamic monopolies
@@ Property / cites work: Size bounds for dynamic monopolies / rank @@
+Normal rank
@@ Property / cites work @@
+The shortest common supersequence problem over binary alphabet is NP- complete
+Normal rank