Abstract
In this study, string rewriting P systems with communication by request is used in solving the satisfiability problem, or SAT. The family of solutions using this class of rewriting P system is shown to be uniform, in terms of the number of clauses and variables of the input boolean formula. This rewriting P system is then used as components for the construction of a distributed P system solving SAT. It is shown in this work that encoding the truth assignment for the communication steps only require a polynomial number of rules to implement, but requires an exponential-sized set of inter-component communication rules to achieve a low communication cost.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
