Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:idus.us.es:11441/84112

Limits on P Systems with Proteins and Without Division

Authors
Publication date
1 January 2018
Publisher
Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática

Abstract

In the field of Membrane Computing, computational complexity theory has been widely studied trying to nd frontiers of efficiency by means of syntactic or semantical ingredients. The objective of this is to nd two kinds of systems, one non-efficient and another one, at least, presumably efficient, that is, that can solve NP-complete prob- lems in polynomial time, and adapt a solution of such a problem in the former. If it is possible, then P = NP. Several borderlines have been defi ned, and new characterizations of different types of membrane systems have been published. In this work, a certain type of P system, where proteins act as a supporting element for a rule to be red, is studied. In particular, while division rules, the abstraction of cellular mitosis is forbidden, only problems from class P can be solved, in contrast to the result obtained allowing them.Ministerio de Economía y Competitividad TIN2017-89842-PNational Natural Science Foundation of China No 6132010600

Similar works

Full text

thumbnail-image

idUS. Depósito de Investigación Universidad de Sevilla

redirect
oaioai:idus.us.es:11441/84112
Last time updated on 20/03/2019

This paper was published in idUS. Depósito de Investigación Universidad de Sevilla.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.