Minimal controllability of conjunctive Boolean networks is NP-complete

被引：37
|
作者：
Weiss, Eyal [1 ]
Margaliot, Michael [1 ,2 ]
Even, Guy [1 ]
机构：
[1] Tel Aviv Univ, Dept EE Syst, IL-69978 Tel Aviv, Israel
[2] Tel Aviv Univ, Sagol Sch Neurosci, IL-69978 Tel Aviv, Israel
来源：
AUTOMATICA | 2018年 / 92卷
基金：
以色列科学基金会;
关键词：
MODELS;
D O I：
10.1016/j.automatica.2018.02.014
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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(n(2))-time algorithm for testing controllability; and prove that nonetheless the minimal controllability problem for CBNs is NP-hard. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码：56 / 62
页数：7
相关论文
共 50 条
  • [1] Neural networks for NP-complete problems
    Budinich, M
    NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 1997, 30 (03) : 1617 - 1624
  • [2] Controllability of Conjunctive Boolean Networks With Application to Gene Regulation
    Gao, Zuguang
    Chen, Xudong
    Basar, Tamer
    IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2018, 5 (02): : 770 - 781
  • [3] The minimal logically-defined NP-complete problem
    Barbanchon, R
    Grandjean, E
    STACS 2004, PROCEEDINGS, 2004, 2996 : 338 - 349
  • [4] Hashiwokakero is NP-complete
    Andersson, Daniel
    INFORMATION PROCESSING LETTERS, 2009, 109 (19) : 1145 - 1146
  • [5] Minesweeper is NP-complete
    Richard Kaye
    The Mathematical Intelligencer, 2000, 22 : 9 - 15
  • [6] Shellability is NP-complete
    Goaoc, Xavier
    Patak, Pavel
    Patakova, Zuzana
    Tancer, Martin
    Wagner, Uli
    JOURNAL OF THE ACM, 2019, 66 (03)
  • [7] Rikudo is NP-complete
    Viet-Ha Nguyen
    Perrot, Kevin
    THEORETICAL COMPUTER SCIENCE, 2022, 910 : 34 - 47
  • [8] Minesweeper is NP-complete
    Kaye, R
    MATHEMATICAL INTELLIGENCER, 2000, 22 (02): : 9 - 15
  • [9] BLOCKSUM is NP-Complete
    Haraguchi, Kazuya
    Ono, Hirotaka
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03) : 481 - 488
  • [10] Tipover is NP-complete
    Robert A. Hearn
    The Mathematical Intelligencer, 2006, 28 : 10 - 14
12345