Counting Fixed Points and Gardens of Eden of Sequential Dynamical Systems on Planar Bipartite Graphs.
作者： Predrag T. Tosic
DOI:
关键词:
摘要:
hpi-web.de参考文章(28)
Frederic Green, NP-Complete Problems in Cellular Automata. Complex Systems. ,vol. 1, ,(1987)
Stephen Wolfram, Theory and Applications of Cellular Automata Advanced Series on Complex Systems. ,(1986)
J. J. Hopfield, D. W. Tank, Neural computation of decisions in optimization problems Biological Cybernetics. ,vol. 52, pp. 141- 152 ,(1985) , 10.1007/BF00339943
Max Garzon, Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks ,(2012)
Dan Roth, On the hardness of approximate reasoning Artificial Intelligence. ,vol. 82, pp. 273- 302 ,(1996) , 10.1016/0004-3702(94)00092-1
Christian Schittenkopf, Gustavo Deco, Wilfried Brauer, Finite automata-models for the investigation of dynamical systems Information Processing Letters. ,vol. 63, pp. 137- 141 ,(1997) , 10.1016/S0020-0190(97)00110-5
Harry B. Hunt, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard E. Stearns, The Complexity of Planar Counting Problems SIAM Journal on Computing. ,vol. 27, pp. 1142- 1167 ,(1998) , 10.1137/S0097539793304601
Mark Jerrum, Two-dimensional monomer-dimer systems are computationally intractable Journal of Statistical Physics. ,vol. 48, pp. 121- 134 ,(1987) , 10.1007/BF01025864
C.L. Barrett, C.M. Reidys, Elements of a theory of computer simulation I: Sequential CA over random graphs Applied Mathematics and Computation. ,vol. 98, pp. 241- 259 ,(1999) , 10.1016/S0096-3003(97)10166-7
C.L. Barrett, H.S. Mortveit, C.M. Reidys, Elements of a theory of simulation II: sequential dynamical systems Applied Mathematics and Computation. ,vol. 107, pp. 121- 136 ,(2000) , 10.1016/S0096-3003(98)10114-5