| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422997 | Electronic Notes in Theoretical Computer Science | 2013 | 11 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
