Presentation
On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution
Author/s | Zandron, Claudio
Leporati, Alberto Ferretti, Claudio Mauri, Giancarlo Pérez Jiménez, Mario de Jesús |
Department | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Publication Date | 2008 |
Deposit Date | 2016-03-18 |
Published in |
|
ISBN/ISSN | 9788461244294 |
Abstract | Recognizer P systems with active membranes have proven to be very powerful
computing devices, being able to solve NP-complete decision problems in a polynomial
time. However such solutions usually exploit many powerful ... Recognizer P systems with active membranes have proven to be very powerful computing devices, being able to solve NP-complete decision problems in a polynomial time. However such solutions usually exploit many powerful features, such as electrical charges (polarizations) associated to membranes, evolution rules, communication rules, and strong or weak forms of division rules. In this paper we contribute to the study of the computational power of polarizationless recognizer P systems with active membranes. Precisely, we show that such systems are able to solve in polynomial time the NP-complete decision problem 3-sat by using only dissolution rules and a form of strong division for non–elementary membranes, working in the maximal parallel way. |
Files | Size | Format | View | Description |
---|---|---|---|---|
strongdivision.pdf | 299.7Kb | [PDF] | View/ | |