Solving NP-complete problems using P-systems with active membranes

Recommendations

P systems with active membranes: Attacking NP-complete problems
Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
A new approach for solving SAT by P systems with active membranes
Computational complexity of P systems with active membranes
scientific article; zbMATH DE number 2118901
Solving the subset-problem by P systems with active membrans
Time-free solution to SAT problem using P systems with active membranes
Aspects of Molecular Computing
Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
Aspects of Molecular Computing

Cited in

(81)

Solving the N-queens problem using dP systems with active membranes
The counting power of P systems with antimatter
Design patterns for efficient solutions to NP-complete problems in membrane computing
Languages generated by P systems with active membranes
A guide to membrane computing.
On the power of membrane division in P systems
From regulated rewriting to computing with membranes: collapsing hierarchies
A Turing machine simulation by P systems without charges
Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion
Bounding the space in P systems with active membranes
Simulating counting oracles with cooperation
Solving a PSPACE-complete problem with cP systems
Seeking computational efficiency boundaries: the Păun's conjecture
Alternative space definitions for P systems with active membranes
A new method to simulate restricted variants of polarizationless P systems with active membranes
Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
Depth-two P systems can simulate Turing machines with \textbf{NP} oracles
On the power of P systems with active membranes using weak non-elementary membrane division
Subroutines in P systems and closure properties of their complexity classes
Tissue-like P systems with evolutional symport/antiport rules
Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
P systems with proteins: a new frontier when membrane division disappears
Characterizing PSPACE with shallow non-confluent P systems
Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
Monodirectional P systems
Solving the bin-packing problem by means of tissue P system with 2-division
Time-free solution to SAT problem using P systems with active membranes
Space complexity equivalence of P systems with active membranes and Turing machines
Solving HPP and SAT by P systems with active membranes and separation rules
Complexity aspects of polarizationless membrane systems
P systems with valuations
On P systems with active membranes
P systems with active membranes: Attacking NP-complete problems
P systems with energy accounting^∗
A linear-time tissue P system based solution for the 3-coloring problem
P systems simulating oracle computations
Remarks on the computational power of some restricted variants of P systems with active membranes
Shallow non-confluent P systems
Selected Topics in Computational Complexity of Membrane Systems
Membrane Dissolution and Division in P
P SYSTEMS WITH INPUT IN BINARY FORM
Computational efficiency of dissolution rules in membrane systems
Complexity classes for membrane systems
A polynomial complexity class in P systems using membrane division
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
Accelerated execution of P systems with active membranes to solve the N-queens problem
Asynchronous P systems with active membranes
Self-activating P systems
Decision P systems and the P NP conjecture
scientific article; zbMATH DE number 1958491 (Why is no real title available?)
A linear time complexity of breadth-first search using P system with membrane division
scientific article; zbMATH DE number 2118901 (Why is no real title available?)
A framework for complexity classes in membrane computing
A toolbox for simpler active membrane algorithms
Efficiently solving the bin packing problem through bio-inspired mobility
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs
The computational power of membrane systems under tight uniformity conditions
On the efficiency of a variant of P systems with mobile membranes
Solving Numerical NP-Complete Problems with Spiking Neural P Systems
Aspects of Molecular Computing
Membrane Computing
On the computational complexity of membrane systems
Solving SAT with P systems with anti-membranes
A bibliometric analysis of membrane computing (1998--2019)
On the power of membrane dissolution in polarizationless P systems with active membranes
Towards automated deduction in cP systems
Active P-colonies
Solving 3-SAT in distributed P systems with string objects
A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules
Evaluating space measures in P systems
A key agreement protocol based on spiking neural P systems with anti-spikes
Spiking neural P systems: main ideas and results
Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
Solving the 3-COL problem by using tissue P systems without environment and proteins on cells
Non-confluence in divisionless P systems with active membranes
Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
Membrane computing and complexity theory: A characterization of PSPACE
Solving the factorization problem with P systems
A uniform family of tissue P systems with cell division solving 3-COL in a linear time
Computational complexity of tissue-like P systems
Compositional semantics of spiking neural P systems

This page was built for publication: Solving NP-complete problems using P-systems with active membranes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707541)