论文信息 - The complexity of the majority rule on planar graphs

The complexity of the majority rule on planar graphs

We study the complexity of the majority rule on planar automata networks. We reduce a special case of the Monotone Circuit Value Problem to the prediction problem of determining if a vertex of a planar graph will change its state when the network is updated with the majority rule.

Eric Goles | Pedro Montealegre | E. Goles | Pedro Montealegre

[1] S. Rao Kosaraju,et al. An NC Algorithm for Evaluating Monotone Planar Circuits , 1995, SIAM J. Comput..

[2] Eric Goles Ch.,et al. Decreasing energy functions as a tool for studying threshold networks , 1985, Discret. Appl. Math..

[3] H. James Hoover,et al. Limits to Parallel Computation: P-Completeness Theory , 1995 .

[4] Eric Goles Ch.,et al. The complexity of the bootstraping percolation and other problems , 2013, Theor. Comput. Sci..

[5] E. G. Chacc. Comportement oscillatoire d'une famille d'automates cellulaires non uniformes , 1980 .

[6] Cristopher Moore. Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness , 1997 .