<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miguel A. Gutiérrez-Naranjo</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Agustín Riscos-Núñez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards a programming language in cellular computing</style></title><secondary-title><style face="normal" font="default" size="100%">Electronic Notes in Theoretical Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Membrane Computing; Complexity Class; Cellular Subroutine; NP-complete problem</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B75H1-4FJT8PX-J&_user=603129&_coverDate=03%2F01%2F2005&_rdoc=6&_fmt=full&_orig=browse&_srch=doc-info(%23toc%2313109%232005%23998769999%23574761%23FLP%23display%23Volume)&_cdi=13109&_sort=d&_docancho</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://cantor.cs.us.es/files/Towards a programming language in cellular computing.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Holanda</style></pub-location><volume><style face="normal" font="default" size="100%">123</style></volume><pages><style face="normal" font="default" size="100%">93-110</style></pages><abstract><style face="normal" font="default" size="100%">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. 
</style></abstract></record></records></xml>