Complexity of fixed point counting problems in Boolean Networks

Florian Bridoux, Amélia Durbec, Kévin Perrot +1

A Boolean network (BN) with $n$ components is a discrete dynamical system described by the successive iterations of a function $f:\{0,1{\}}^n\to \{0,1{\}}^n$. This model finds applica…