P systems with proteins on membranes and membrane division

摘要: In this paper we present a method for solving the NP-complete SAT problem using type of P systems that is defined in [9]. The solved O(nm) time, where n number boolean variables and m clauses instance written conjunctive normal form. Thus can say solution each given obtained linear time. We succeeded by uniform construction deterministic system which uses rules involving objects regions, proteins on membranes, membrane division. also investigate computational power with membranes show universality be reached even case do not use division have only one membrane.