Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems

[1]  N. Linial.  Hard enumeration problems in geometry and combinatorics , 1986 .

[2]  Alexander Moshe Rabinovich,et al.  Complexity of Equivalence Problems for Concurrent Systems of Finite Agents , 1997, Inf. Comput..

[3]  Harry B. Hunt,et al.  Reachability problems for sequential dynamical systems with threshold functions , 2003, Theor. Comput. Sci..

[4]  Harry B. Hunt,et al.  Predecessor and Permutation Existence Problems for Sequential Dynamical Systems , 2003, DMCS.

[5]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[6]  Christian M. Reidys,et al.  Elements of a theory of computer simulation I: Sequential CA over random graphs , 1999, Appl. Math. Comput..

[7]  Salil P. Vadhan,et al.  The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..

[8]  Frederic Green,et al.  NP-Complete Problems in Cellular Automata , 1987, Complex Syst..

[9]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[10]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[11]  Paul D. Seymour,et al.  Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.

[12]  Sven Kosub,et al.  Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems , 2008, Math. Comput. Sci..

[13]  Klaus Sutner,et al.  On the Computational Complexity of Finite Cellular Automata , 1995, J. Comput. Syst. Sci..

[14]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[15]  Michael J. Dinneen,et al.  A Characterization of Graphs with Vertex Cover up to Five , 1994, ORDAL.

[16]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

[17]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[18]  Emil L. Post.  The two-valued iterative systems of mathematical logic , 1942 .

[19]  Harry B. Hunt,et al.  Gardens of Eden and Fixed Points in Sequential Dynamical Systems , 2001, DM-CCG.

[20]  Stephen Wolfram,et al.  Cellular Automata And Complexity , 1994 .

[21]  John N. Tsitsiklis,et al.  On the predictability of coupled automata: an allegory about chaos , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[22]  Nadia Creignou,et al.  Complexity of Generalized Satisfiability Counting Problems , 1996, Inf. Comput..

[23]  Harry B. Hunt,et al.  Complexity of reachability problems for finite discrete dynamical systems , 2006, J. Comput. Syst. Sci..

[24]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.