6 citations · 13 across the 21 of their papers we have counts for
4 papers · 1 filter
On the complexity of acyclic modules in automata networks
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
Modules were introduced as an extension of Boolean automata networks. They have inputs which are used in the computation said modules perform, and can be used to wire modules with…
How hard is it to predict sandpiles on lattices? A survey
Kévin Perrot, Enrico Formenti
Since their introduction in the 80s, sandpile models have raised interest for their simple definition and their surprising dynamical properties. In this survey we focus on the comp…
On the complexity of counting feedback arc sets
Kevin Perrot
In this note we study the computational complexity of feedback arc set counting problems in directed graphs, highlighting some subtle yet common properties of counting classes. Cou…
NP-completeness of the game Kingdomino
Viet-Ha Nguyen, Kevin Perrot, Mathieu Vallet
Kingdomino is a board game designed by Bruno Cathala and edited by Blue Orange since 2016. The goal is to place dominoes on a grid layout, and get a better score than…