A linear solution for QSAT with membrane creation

Authors:
Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez;Francisco J. Romero-Campero
Affiliations:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain
Venue:
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Year:
2005

Citing 5
Cited 5

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A fast P system for finding a balanced 2-partition

Soft Computing - A Fusion of Foundations, Methodologies and Applications
A linear solution of subset sum problem by using membrane creation

IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I

A Linear--time Tissue P System Based Solution for the 3--coloring Problem

Electronic Notes in Theoretical Computer Science (ENTCS)
Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division

IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
Computational complexity of tissue-like P systems

Journal of Complexity
P systems and computational algebraic topology

Mathematical and Computer Modelling: An International Journal
The efficiency of tissue p systems with cell separation relies on the environment

CMC'12 Proceedings of the 13th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The usefulness of P systems with membrane creation for solving NP problems has been previously proved (see [2, 3]), but, up to now, it was an open problem whether such P systems were able to solve PSPACE-complete problems in polynomial time. In this paper we give an answer to this question by presenting a uniform family of P system with membrane creation which solves the QSAT-problem in linear time.