Minimal controllability of conjunctive Boolean networks is NP-complete

Eyal Weiss, Michael Margaliot*, Guy Even

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Given a conjunctive Boolean network (CBN) with n state-variables, we consider the problem of finding a minimal set of state-variables to directly affect with an input so that the resulting conjunctive Boolean control network (CBCN) is controllable. We give a necessary and sufficient condition for controllability of a CBCN; an O(n2)-time algorithm for testing controllability; and prove that nonetheless the minimal controllability problem for CBNs is NP-hard.

Original languageEnglish
Pages (from-to)56-62
Number of pages7
StatePublished - Jun 2018


FundersFunder number
Israeli Ministry of Science, Technology & Space
Ministry of Science, Technology and Space
Israel Science Foundation410/15


    Dive into the research topics of 'Minimal controllability of conjunctive Boolean networks is NP-complete'. Together they form a unique fingerprint.

    Cite this