| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9655951 | Electronic Notes in Theoretical Computer Science | 2005 | 18 Pages |
Abstract
Several solutions to hard numerical problems using P systems have been presented recently, and strong similarities in their designs have been noticed. In this paper we present a new solution, to the Partition problem, via a family of deterministic P systems with active membranes using 2-division. Then, we intend to show that the idea of a cellular programming language is possible (at least for some relevant family of NP-complete problems), indicating some “subroutines” that can be used in a variety of situations and therefore could be useful for designing solutions for new problems in the future.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, AgustÃn Riscos-Núñez,