<?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%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Álvaro Romero-Jiménez</style></author><author><style face="normal" font="default" size="100%">Fernando Sancho-Caparrini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Decision P systems and the P≠NP conjecture</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/3-540-36490-0_27</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam, The Netherlands</style></pub-location><volume><style face="normal" font="default" size="100%">2597</style></volume><pages><style face="normal" font="default" size="100%">388-399</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-00611-4</style></isbn><abstract><style face="normal" font="default" size="100%">We introduce decision P systems,which are a class of P systems with symbol-objects and external output. The main result of the paper is the following:if there exists an NP-complete problem that cannot be solved in polynomial time,with respect to the input length,by a deterministic decision P system constructed in polynomial time,then P≠NP. From Zandron-Ferreti-Mauri’s theorem it follows that if P≠ NP,then no NP-complete problem can be solved in polynomial time, with respect to the input length,by a deterministic P system with active membranes but without membrane division,constructed in polynomial time from the input. Together,these results give a characterization of P≠NP in terms of deterministic P systems. </style></abstract></record></records></xml>