Minimal Controllability of Conjunctive Boolean Networks is NP-Complete
Data Structures and Algorithms
2020-06-09 v1 Computational Complexity
Systems and Control
Optimization and Control
Molecular Networks
Abstract
Given a conjunctive Boolean network (CBN) with 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 -time algorithm for testing controllability; and prove that nonetheless the minimal controllability problem for CBNs is NP-hard.
Cite
@article{arxiv.1704.07291,
title = {Minimal Controllability of Conjunctive Boolean Networks is NP-Complete},
author = {Eyal Weiss and Michael Margaliot and Guy Even},
journal= {arXiv preprint arXiv:1704.07291},
year = {2020}
}