Minimal Controllability of Conjunctive Boolean Networks is NP-Complete
نویسندگان
چکیده
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)-time algorithm for testing controllability; and prove that nonetheless the minimal controllability problem for CBNs is NP-hard.
منابع مشابه
Maximum Satisfiability
The Boolean satisfiability problem (SAT) is the problem of deciding, given a Boolean expression in variables x1, · · · , xn, whether some assignment of the variables makes the expression true. SAT is historically notable because it was the first problem proven to be NP-complete. (Before this point, the idea of NP-completeness had been formulated, but no one had proven that there actually existe...
متن کاملNP-Completeness of Refutability by Literal-Once Resolution
A boolean formula in conjunctive normal form (CNF) F is refuted by literal–once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Literal–once resolution refutations can be found nondeterministically in polynomial time, though this restricted system is not complete. We show that despite of the weakness of literal–once resolution, the recognition o...
متن کاملSubtractive Reductions and Complete Problems for Counting Complexity Classes
We introduce and investigate a new type of reductions between counting problems, which we call subtractive reductions. We show that the main counting complexity classes #P, #NP, as well as all higher counting complexity classes # · kP, k 2, are closed under subtractive reductions. We then pursue problems that are complete for these classes via subtractive reductions. We focus on the class #NP (...
متن کاملThe k-Satisfiability problem remains NP-complete for dense families
We consider the ~ATISFIABILITY problem (~-SAT): Given a family F of n clauses cl, ._, , c, in conjunctive normal form, each consisting of k literals corresponding to k different variables of a set of r 2 k 2 1 boolean variables, is F satisfiable? By k-SAT@ no) we denote the k-SAT problem restricted to families with n > n,(r) clauses. We prove that for each k > 3 and each integer I > 4 such that...
متن کاملOn the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas
It is a wellknown fact that the satisfiability problem (SAT) for Boolean formulas in a conjunctive normal form (CNF) is NP complete, i.e. Σ1 complete. It is also known that the decision version of Boolean minimization for CNF inputs is Σ2 complete. On the other hand there are several subclasses of CNFs (e.g. Horn CNFs) for which SAT is known to be in P = Σ0 while the minimization problem is Σ1 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1704.07291 شماره
صفحات -
تاریخ انتشار 2017