Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables

DOI10.1007/978-3-642-54239-8_14zbMath1407.68169OpenAlexW2187311691MaRDI QIDQ5404852

Zsolt Gazdag

Publication date: 28 March 2014

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54239-8_14

zbMATH Keywords

SAT problemP systemsmembrane computing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (7)

Solving the N-queens problem using dP systems with active membranes ⋮ On the power of P systems with active membranes using weak non-elementary membrane division ⋮ Solving SAT with P systems with anti-membranes ⋮ Solving 3-SAT in distributed P systems with string objects ⋮ Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes ⋮ Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion ⋮ A new method to simulate restricted variants of polarizationless P systems with active membranes

This page was built for publication: Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables