ScholarLens Back to search
2009•Unpublished venueRequires access

in divisionless P systems with active membranes

Antonio E. Porreca, Giancarlo Mauri, Claudio Zandron

Open publisher page 0 citations

Abstract

We describe a solution to the SAT problem via non-conuent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simulating such devices on a nondeterministic Turing machine with a polynomial slowdown. Together, these results prove that the complexity class of problems solvable non-conuently and in polynomial time by this kind of P systems is exactly the class NP.

About this research paper

What this paper is about

We describe a solution to the SAT problem via non-conuent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simulating such devices on a nondeterministic Turing machine with a polynomial slowdown. Together, these results prove that the complexity class of problems solvable non-conuently and in polynomial time by this kind of P systems is exactly the class NP.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We describe a solution to the SAT problem via non-conuent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simulating such devices on a nondeterministic Turing machine with a polynomial slowdown. Together, these results prove that the complexity class of problems solvable non-conuently and in polynomial time by this kind of P systems is exactly the class NP.

Key concepts: Nondeterministic algorithm, Turing machine, Membrane computing, Time complexity, Class (philosophy), NP, Polynomial, Complexity class

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
in divisionless P systems with active membranes — Research Paper | ScholarLens