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 条
  • [41] TENSOR RANK IS NP-COMPLETE
    HASTAD, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 372 : 451 - 460
  • [42] Decidability of NP-Complete Problems
    Vagis, A. A.
    Gupal, A. M.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2022, 58 (06) : 914 - 916
  • [43] Lambek calculus is NP-complete
    Pentus, Mati
    THEORETICAL COMPUTER SCIENCE, 2006, 357 (1-3) : 186 - 201
  • [44] Hamiltonian index is NP-complete
    Ryjacek, Zdenek
    Woeginger, Gerhard J.
    Xiong, Liming
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (04) : 246 - 250
  • [45] An NP-complete fragment of LTL
    Muscholl, A
    Walukiewicz, I
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2005, 16 (04) : 743 - 753
  • [46] Autoreducibility of NP-Complete Sets
    Hitchcock, John M.
    Shafei, Hadi
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [47] Elastic image matching is NP-complete
    Keysers, D
    Unger, W
    PATTERN RECOGNITION LETTERS, 2003, 24 (1-3) : 445 - 453
  • [48] Theory-contraction is NP-complete
    Tennant, Neil
    LOGIC JOURNAL OF THE IGPL, 2003, 11 (06) : 675 - 693
  • [49] Border Basis Detection is NP-complete
    Ananth, Prabhanjan V.
    Dukkipati, Ambedkar
    ISSAC 2011: PROCEEDINGS OF THE 36TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 2011, : 11 - 18
  • [50] A simplified NP-complete MAXSAT problem
    Raman, V
    Ravikumar, B
    Rao, SS
    INFORMATION PROCESSING LETTERS, 1998, 65 (01) : 1 - 6
12345