Characterizing Tractability with Membrane Creation

Authors:
Miguel A. Gutierrez-Naranjo;Mario J. Perez-Jimenez;Agustin Riscos-Nunez;Francisco J. Romero-Campero
Affiliations:
University of Sevilla;University of Sevilla;University of Sevilla;University of Sevilla
Venue:
SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Year:
2005

Citing 0
Cited 2

A uniform solution to SAT using membrane creation

Theoretical Computer Science
Membrane Computing and Brane Calculi (Some Personal Notes)

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper analyzes the role that membrane dissolution rules play in order to characterize (in the framework of recognizer P systems with membrane creation) the tractability of decision problems — that is, the efficient solvability of problems by deterministic Turing machines. In this context, the use or not of these rules provides an interesting borderline between the tractability and the (presumable) intractability.