Some Remarks Concerning the Algorithmic Analysis of Gene Regulatory Networks

In this work we study an algorithmic problem related to gene regulatory networks. This problem is the counting of fixed points in boolean networks. We focus our attention on monomial networks, and we prove that the counting of fixed points is #P complete even in this restricted case.