Computational complexity of threshold automata networks under different updating schemes - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2014

Computational complexity of threshold automata networks under different updating schemes

Abstract

Given a threshold automata network, as well as an updating scheme over its vertices, we study the computational complexity associated with the prediction of the future state of a vertex. More precisely, we analyze two classes of local functions: the majority and the AND–OR rule (vertices take the And or the Or logic functions over the state of its neighborhoods). Depending on the updating scheme, we determine the complexity class (NC, P, NP, PSPACE) where the prediction problem belongs.

Dates and versions

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

Identifiers

Cite

Eric Goles Chacc, Pedro Montealegre. Computational complexity of threshold automata networks under different updating schemes. Theoretical Computer Science, 2014, 559, pp.3-19. ⟨10.1016/j.tcs.2014.09.010⟩. ⟨hal-01315323⟩
50 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More