On the complexity of the generalized Q2R automaton
Discrete Mathematics
2021-08-10 v1 Computational Complexity
Abstract
We study the dynamic and complexity of the generalized Q2R automaton. We show the existence of non-polynomial cycles as well as its capability to simulate with the synchronous update the classical version of the automaton updated under a block sequential update scheme. Furthermore, we show that the decision problem consisting in determine if a given node in the network changes its state is \textbf{P}-Hard.
Keywords
Cite
@article{arxiv.2108.03335,
title = {On the complexity of the generalized Q2R automaton},
author = {Eric Goles and Marco Montalva-Medel and Pedro Montealegre and Martín Ríos-Wilson},
journal= {arXiv preprint arXiv:2108.03335},
year = {2021}
}