Journal
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
Volume 66, Issue 6, Pages 867-872Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jpdc.2006.01.003
Keywords
membrane computing; distributed computing; Turing computability; SAT problem
Categories
Ask authors/readers for more resources
P systems (or membrane systems) are a class of distributed parallel Computing devices of a biochemical type. In this paper, some restrictions on the general form of the developing rules are considered, under which it is still possible to solve NP-complete problems. We present an algorithm for deterministically deciding SAT in linear time by P systems with active membranes using two polarizations and rules of restricted versions of types (a). (c). (e). The result obtained in this paper answered an open problem proposed by Alhazov and Freund in the aspect of computing efficiency. (C) 2006 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available