Repositorio de producción científica de la Universidad de Sevilla

A Logarithmic Bound for Solving Subset Sum with P Systems

 

Advanced Search
 
Opened Access A Logarithmic Bound for Solving Subset Sum with P Systems
Cites

Show item statistics
Icon
Export to
Author: Díaz Pernil, Daniel
Gutiérrez Naranjo, Miguel Ángel
Pérez Jiménez, Mario de Jesús
Riscos Núñez, Agustín
Department: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Date: 2007
Published in: WMC 2007: International Workshop on Membrane Computing (2007), p 257-270
ISBN/ISSN: 978-3-540-77311-5
0302-9743
Document type: Presentation
Abstract: The aim of our paper is twofold. On one hand we prove the ability of polarizationless P systems with dissolution and with division rules for non-elementary membranes to solve NP-complete problems in a polynomial number of steps, and we do this by...
[See more]
Cite: Díaz Pernil, D., Gutiérrez Naranjo, M.Á., Pérez Jiménez, M.d.J. y Riscos Núñez, A. (2007). A Logarithmic Bound for Solving Subset Sum with P Systems. En WMC 2007: International Workshop on Membrane Computing (257-270), Tesalonica, Grecia: Springer.
Size: 569.9Kb
Format: PDF

URI: http://hdl.handle.net/11441/57252

DOI: 10.1007/978-3-540-77312-2_16

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)