Solving SAT with P systems with anti-membranes

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
An efficient time-free solution to SAT problem by P systems with proteins on membranes
Efficiently solving the bin packing problem through bio-inspired mobility
Enhanced mobile membranes: computability results
Mobility in process calculi and natural computing.
Trading polarizations for labels in P systems with active membranes
Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
A uniform solution to SAT using membrane creation
Simulating a P system based efficient solution to SAT by using GPUs
Complexity classes in models of cellular computing with membranes
Solving the N-queens problem using dP systems with active membranes
Real-life applications with membrane computing
Membrane computing. An introduction.
Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion
Synchronization of rules in membrane computing
Tissue-like P systems with evolutional symport/antiport rules
Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
Adaptive P systems
Time-free solution to SAT problem using P systems with active membranes
Solving HPP and SAT by P systems with active membranes and separation rules
Describing the Immune System Using Enhanced Mobile Membranes
Turing Completeness Using Three Mobile Membranes
A New Approach for Solving SAT by P Systems with Active Membranes
Antimatter as a Frontier of Tractability in Membrane Computing
Membrane Computing
A Kernel P Systems Survey
Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables
Matter and Anti-Matter in Membrane Systems
P Systems with Anti-Matter
On the efficiency of synchronized P systems
From \texttt{SAT} to \texttt{SAT}-\texttt{UNSAT} using P systems with dissolution rules

This page was built for publication: Solving SAT with P systems with anti-membranes