A uniform solution to SAT using membrane creation
From MaRDI portal
Publication:870255
DOI10.1016/J.TCS.2006.10.013zbMath1108.68058OpenAlexW2086485204MaRDI QIDQ870255
Francisco J. Romero-Campero, Mario J. Pérez-Jiménez, Miguel Á. Gutiérrez-Naranjo
Publication date: 12 March 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.013
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (14)
Denotational semantics of membrane systems by using complete metric spaces ⋮ Solving SAT with P systems with anti-membranes ⋮ Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem ⋮ The power of synchronizing rules in membrane computing ⋮ On the efficiency of synchronized P systems ⋮ Solving 3-SAT in distributed P systems with string objects ⋮ Cell-like P systems with evolutional symport/antiport rules and membrane creation ⋮ The computational power of timed P systems with active membranes using promoters ⋮ LOGIC AND ARITHMETIC OPERATIONS WITH A CONSTANT NUMBER OF STEPS IN MEMBRANE COMPUTING ⋮ Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion ⋮ Time-free solution to SAT problem by tissue P systems ⋮ Computational efficiency and universality of timed P systems with membrane creation ⋮ Tissue P systems with cell separation: attacking the partition problem ⋮ Subroutines in P systems and closure properties of their complexity classes
Cites Work
This page was built for publication: A uniform solution to SAT using membrane creation
