On the complexity of two-dimensional signed majority cellular automata
暂无分享,去创建一个
Eric Goles Ch. | Pedro Montealegre-Barba | Kévin Perrot | Guillaume Theyssier | E. Goles | Kévin Perrot | Pedro Montealegre | Guillaume Theyssier
[1] Eric Allender,et al. Planar and Grid Graph Reachability Problems , 2009, Theory of Computing Systems.
[2] Eric Goles Ch.,et al. Periodic behaviour of generalized threshold functions , 1980, Discret. Math..
[3] Ryuuzo Shingai,et al. Maximum Period of 2-Dimensional Uniform Neural Networks , 1979, Inf. Control..
[4] Eric Goles Ch.. Threshold Networks and Generalizations , 1986, Automata Networks.
[5] Eric Goles Ch.,et al. The complexity of the bootstraping percolation and other problems , 2013, Theor. Comput. Sci..
[6] Turlough Neary,et al. P-completeness of Cellular Automaton Rule 110 , 2006, ICALP.
[7] Nicolas Ollinger,et al. Universalities in Cellular Automata , 2012, Handbook of Natural Computing.
[8] Eric Goles Ch.,et al. Communication complexity and intrinsic universality in cellular automata , 2011, Theor. Comput. Sci..
[9] H. James Hoover,et al. Limits to Parallel Computation: P-Completeness Theory , 1995 .
[10] G. Hardy,et al. An Introduction to the Theory of Numbers , 1938 .
[11] Nicolas Ollinger,et al. Four states are enough! , 2011, Theor. Comput. Sci..
[12] F. Barahona. On the computational complexity of Ising spin glass models , 1982 .
[13] Dexter Kozen. Theory of Computation , 2006, Texts in Computer Science.
[14] E. Berlekamp,et al. Winning Ways for Your Mathematical Plays , 1983 .
[15] A. Waters. Winning ways. , 2002, Nursing standard (Royal College of Nursing (Great Britain) : 1987).
[16] Erik D. Demaine,et al. The Two-Handed Tile Assembly Model is not Intrinsically Universal , 2013, Algorithmica.
[17] Eric Goles Ch.,et al. Decreasing energy functions as a tool for studying threshold networks , 1985, Discret. Appl. Math..
[18] L. Bieche,et al. On the ground states of the frustration model of a spin glass by a matching method of graph theory , 1980 .
[19] Cristopher Moore. Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness , 1997 .
[20] Damien Regnault,et al. Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority , 2007, Theor. Comput. Sci..
[21] Peter Bro Miltersen,et al. On monotone planar circuits , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[22] Nicolas Ollinger,et al. Bulking I: An abstract theory of bulking , 2011, Theor. Comput. Sci..
[23] Jack H. Lutz,et al. The Tile Assembly Model is Intrinsically Universal , 2011, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[24] Eric Goles,et al. The complexity of the majority rule on planar graphs , 2015, Adv. Appl. Math..
[25] Edwin Roger Banks. Universality in Cellular Automata , 1970, SWAT.
[26] Guillaume Theyssier,et al. ON LOCAL SYMMETRIES AND UNIVERSALITY IN CELLULAR , 2009 .
[27] P. Leath,et al. Bootstrap percolation on a Bethe lattice , 1979 .
[28] M. Delorme,et al. Cellular automata : a parallel model , 1999 .
[29] Nicolas Ollinger,et al. Bulking II: Classifications of cellular automata , 2010, Theor. Comput. Sci..
[30] Matthew J. Patitz,et al. Intrinsic universality in tile self-assembly requires cooperation , 2013, SODA.
[31] Cristopher Moore,et al. Quasilinear cellular automata , 1997, adap-org/9701001.