3 papers
cs.CC2025
Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
Pablo Concha-Vega, Eric Goles, Pedro Montealegre +1
In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states , where the local interactions…
cs.CC2025
Timed Prediction Problem for Sandpile Models
Pablo Concha-Vega, Kévin Perrot
We investigate the computational complexity of the timed prediction problem in two-dimensional sandpile models. This question refines the classical prediction problem, which asks w…
cs.CC2025
Is Graph Local Complementation Inherently Sequential?
Pablo Concha-Vega
Local complementation of a graph on vertex is an operation that results in a new graph , where the neighborhood of is complemented. Two graph are locally equivalen…