The complexity of the majority rule on planar graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Advances in Applied Mathematics Year : 2015

The complexity of the majority rule on planar graphs

Abstract

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.

Dates and versions

hal-01315322 , version 1 (13-05-2016)

Identifiers

Cite

Eric Goles Chacc, Pedro Montealegre. The complexity of the majority rule on planar graphs. Advances in Applied Mathematics, 2015, 64, pp.111-123. ⟨10.1016/j.aam.2014.11.005⟩. ⟨hal-01315322⟩
26 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More