Dichotomy results for fixed point counting in Boolean dynamical systems (Q2257296): Difference between revisions

@@ Property / cites work @@
+Q4451017
@@ Property / cites work: Q4451017 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability problems for sequential dynamical systems with threshold functions.
+Normal rank
@@ Property / cites work @@
+Complexity of reachability problems for finite discrete dynamical systems
+Normal rank
@@ Property / cites work @@
+Q4331197
@@ Property / cites work: Q4331197 / rank @@
+Normal rank
@@ Property / cites work @@
+Elements of a theory of simulation. II: Sequential dynamical systems.
+Normal rank
@@ Property / cites work @@
+Elements of a theory of simulation. III: Equivalence of SDS.
+Normal rank
@@ Property / cites work @@
+Elements of a theory of computer simulation. I
@@ Property / cites work: Elements of a theory of computer simulation. I / rank @@
+Normal rank
@@ Property / cites work @@
+Q4031421
@@ Property / cites work: Q4031421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4525262
@@ Property / cites work: Q4525262 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Counting Problems
@@ Property / cites work: The Parameterized Complexity of Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3793734
@@ Property / cites work: Q3793734 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity theory companion
@@ Property / cites work: The complexity theory companion / rank @@
+Normal rank
@@ Property / cites work @@
+Neural networks and physical systems with emergent collective computational abilities.
+Normal rank
@@ Property / cites work @@
+Dichotomy results for fixed-point existence problems for Boolean dynamical systems
+Normal rank
@@ Property / cites work @@
+Hard Enumeration Problems in Geometry and Combinatorics
+Normal rank
@@ Property / cites work @@
+Q4248252
@@ Property / cites work: Q4248252 / rank @@
+Normal rank
@@ Property / cites work @@
+The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+Complexity of equivalence problems for concurrent systems of finite agents
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of finite cellular automata
+Normal rank
@@ Property / cites work @@
+ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
+Normal rank
@@ Property / cites work @@
+Unconventional Computation
@@ Property / cites work: Unconventional Computation / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Q4323873
@@ Property / cites work: Q4323873 / rank @@
+Normal rank