%0 Generic
%D 2005
%T Cellular solutions to some numerical NP-complete problems: A Prolog implementation
%A Andrés Cordón-Franco
%A Miguel A. Gutiérrez-Naranjo
%A Mario J. Pérez-Jiménez
%A Agustín Riscos-Núñez
%E Marian Gheorghe
%I Idea Group Publishing
%P 115-149
%R 10.4018/978-1-59140-333-3
%U http://www.cs.us.es/~marper/investigacion/Cellularsolutions.pdf
%X This chapter is devoted to the study of numerical NP-complete problems in the framework of cellular systems with membranes, also called P systems (Păun, 1998). We present efficient solutions to the Subset-Sum and the Knapsack problems. These solutions are obtained via families of P systems with the capability of generating an exponential amount of working space in polynomial time. Besides, a simulation tool for P systems, written in Prolog, is described. As an illustrative example, a session in the Prolog simulator implementing one of the presented cellular solutions is included.
%@ 978-1591403340
%> http://cantor.cs.us.es/files/Cellularsolutions.pdf