13 citations · 33 across the 22 of their papers we have counts for
Showing 2021 · cs.DMShow all
2 papers · 2 filters
cs.DM2021
On the complexity of the generalized Q2R automaton
Eric Goles, Marco Montalva-Medel, Pedro Montealegre +1
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 upda…
cs.DM2021
Freezing sandpiles and Boolean threshold networks: equivalence and complexity
Eric Goles, Pedro Montealegre Kévin Perrot
The NC versus P-hard classification of the prediction problem for sandpiles on the two dimensional grid with von Neumann neighborhood is a famous open problem. In this paper we mak…