3 citations · 5 across the 6 of their papers we have counts for
4 papers · 1 filter
Solving polynomial equations over partial discrete dynamical systems
Maximilien Gadouleau, Sara Riva, Marius Rolland +1
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviours. If the conditions are ideal and the number of observations…
Injective and pseudo-injective polynomial equations: From permutations to dynamical systems
Antonio E. Porreca, Marius Rolland
We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which i…
Non-trivial automata networks do exist that solve the global majority problem with the local majority rule
Pedro Paulo Balbi, Kévin Perrot, Marius Rolland +1
The global majority problem, often referred to as the Density Classification Task, is a classical benchmark in the context of probing the computational capabilities of automata net…
Majority Boolean networks classifying density: structural characterization and complexity
Kévin Perrot, Marius Rolland
Given a set of entities each holding a Boolean state, the Density Classification Task (DCT) asks them to converge to the most represented state. Given a directed graph of entities…