Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness
暂无分享,去创建一个
[1] S. Rao Kosaraju,et al. An NC Algorithm for Evaluating Monotone Planar Circuits , 1995, SIAM J. Comput..
[2] J. Machta,et al. Parallel algorithm and dynamic exponent for diffusion-limited aggregation , 1997 .
[3] Cristopher Moore. Non-Abelian Cellular Automata , 1995 .
[4] H. James Hoover,et al. Limits to Parallel Computation: P-Completeness Theory , 1995 .
[5] Leslie M. Goldschlager,et al. A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem , 1980, Information Processing Letters.
[6] J. Machta,et al. The computational complexity of generating random fractals , 1996 .
[7] Cristopher Moore,et al. Quasilinear cellular automata , 1997, adap-org/9701001.
[8] J. Machta,et al. Optimized Parallel Algorithm and Dynamic Exponent for Diffusion-Limited Aggregation , 1996 .
[9] Mats G. Nordahl,et al. Universal Computation in Simple One-Dimensional Cellular Automata , 1990, Complex Syst..