
Rikudo is NPcomplete
Rikudo is a numberplacement puzzle, where the player is asked to comple...
read it

Complexity of fixed point counting problems in Boolean Networks
A Boolean network (BN) with n components is a discrete dynamical system ...
read it

Optimising attractor computation in Boolean automata networks
This paper details a method for optimising the size of Boolean automata ...
read it

#Pcompleteness of counting update digraphs, cacti, and a seriesparallel decomposition method
Automata networks are a very general model of interacting entities, with...
read it

Complexity of limitcycle problems in Boolean networks
Boolean networks are a general model of interacting entities, with appli...
read it

On the complexity of acyclic modules in automata networks
Modules were introduced as an extension of Boolean automata networks. Th...
read it

How hard is it to predict sandpiles on lattices? A survey
Since their introduction in the 80s, sandpile models have raised interes...
read it

On the complexity of counting feedback arc sets
In this note we study the computational complexity of feedback arc set c...
read it

NPcompleteness of the game Kingdomino
Kingdomino is a board game designed by Bruno Cathala and edited by Blue ...
read it

Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles
In this paper we prove that the general avalanche problem AP is in NC, f...
read it

Linearity is Strictly More Powerful than Contiguity for Encoding Graphs
Linearity and contiguity are two parameters devoted to graph encoding. L...
read it

A framework for (de)composing with Boolean automata networks
Boolean automata networks (BANs) are a generalisation of Boolean cellula...
read it
Kévin Perrot
is this you? claim profile