%0 Generic
%D 2006
%T P systems with input in binary form
%A Alberto Leporati
%A Claudio Zandron
%A Miguel A. Gutiérrez-Naranjo
%C London, U.K.
%I World Scientific
%K 3-SAT
%K 68Q10 (AMSC)
%K 68Q17 (AMSC)
%K Membrane computing
%K P systems; PARTITION
%N 1
%P 127 - 146
%R 10.1142/S0129054106003735
%V 17
%X Current P systems which solve NP–complete numerical problems represent the instances of the problems in unary notation. However, in classical complexity theory, based upon Turing machines, switching from binary to unary encoded instances generally corresponds to simplify the problem. In this paper we show that, when working with P systems, we can assume without loss of generality that instances are expressed in binary notation. More precisely, we propose a simple method to encode binary numbers using multisets, and a family of P systems which transforms such multisets into the usual unary notation. Such a family could thus be composed with the unary P systems currently proposed in the literature to obtain (uniform) families of P systems which solve NP–complete numerical problems with instances encoded in binary notation. We introduce also a framework which can be used to design uniform families of P systems which solve NP–complete problems (both numerical and non-numerical) working directly on binary encoded instances, i.e., without first transforming them to unary notation. We illustrate our framework by designing a family of P systems which solves the 3-SAT problem. Next, we discuss the modifications needed to obtain a family of P systems which solves the PARTITION numerical problem.