Home › Biblio

Characterizing Tractability by Cell-Like Membrane Systems

Fri, 03/05/2010 - 18:42 — manu
TitleCharacterizing Tractability by Cell-Like Membrane Systems
Publication TypeContributions to Book Chapters
Year of Publication2006
AuthorsGutiérrez-Naranjo, M. A., Pérez-Jiménez M. J., Riscos-Núñez A., Romero-Campero F. J., & Romero-Jiménez Á.
EditorsSubramanian, K. G., Rangarajan K., & Mukund M.
Book TitleFormal models, languages and applications
Series TitleSeries in Machine Perception and Artificial Intelligence
ISBN Number978-981-256-889-2
PublisherWorld Scientific Publishing Company
Place PublishedSingapore
Volume66
Pages137-154
Abstract

In this paper we present a polynomial complexity class in the framework
of membrane computing. In this context, and using accepting transition
P systems, we provide a characterization of the standard computational
class P of problems solvable in polynomial time by deterministic Turing
machines.
URLhttp://www.worldscibooks.com/compsci/6180.html
Chapter9