<?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%">Yunyun Niu</style></author><author><style face="normal" font="default" size="100%">Linqiang Pan</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Solving Common Algorithmic Problem with recognizer tissue P systems</style></title><secondary-title><style face="normal" font="default" size="100%">Romanian Journal of Information Science and Technology</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">membrane computing; tissue P system; cell division; common algorithmic problem</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">06/2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.imt.ro/romjist/Volum15/Number15_1/pdf/03-Niu.pdf</style></url></web-urls></urls><edition><style face="normal" font="default" size="100%">Bio-Inspired Computing – Theory and Applications (BIC-TA) - Selected papers</style></edition><publisher><style face="normal" font="default" size="100%">EDITURA ACADEMIEI ROMÂNE</style></publisher><pub-location><style face="normal" font="default" size="100%">Bucureşti, România</style></pub-location><volume><style face="normal" font="default" size="100%">15</style></volume><pages><style face="normal" font="default" size="100%">33-49</style></pages><abstract><style face="normal" font="default" size="100%">Common Algorithmic Problem is an optimization problem,
which has the nice property that several other NP-complete problems can be
reduced to it in linear time. In this work, we deal with its decision version in
the framework of tissue P systems. A tissue P system with cell division is a
computing model which has two types of rules: communication and division
rules. The ability of cell division allows us to obtain an exponential amount
of cells in linear time and to design cellular solutions to computationally hard
problems in polynomial time. We here present an eﬀective solution to Common
Algorithmic Decision Problem by using a family of recognizer tissue P systems
with cell division. Furthermore, a formal veriﬁcation of this solution is given.</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue><custom1><style face="normal" font="default" size="100%">0.283</style></custom1><custom2><style face="normal" font="default" size="100%">93/100 - Q4</style></custom2></record></records></xml>