Computing with membranes: Attacking NP-complete problems
From MaRDI portal
Recommendations
- Membrane Computing
- scientific article; zbMATH DE number 2155205
- A survey of membrane computing systems attacking hard computational problems
- A computational complexity theory in membrane computing
- Computational complexity aspects in membrane computing
- From NP-completeness to DP-completeness: a membrane computing perspective
- Open problems in membrane computing and how not to solve them
- Aspects of Molecular Computing
- Mathematical Foundations of Computer Science 2005
- Computing with membranes
Cited in
(42)- Computing with membranes
- From distribution to replication in cooperative systems with active membranes: a frontier of the efficiency
- Reaching efficiency through collaboration in membrane systems: dissolution, polarization and cooperation
- Design patterns for efficient solutions to NP-complete problems in membrane computing
- On the robust power of morphogenetic systems for time bounded computation
- From regulated rewriting to computing with membranes: collapsing hierarchies
- From NP-completeness to DP-completeness: a membrane computing perspective
- When object production tunes the efficiency of membrane systems
- P systems attacking hard problems beyond NP: a survey
- Membrane automata for modeling biomolecular processes
- A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division
- Adaptive P systems
- Membrane computing to enhance time efficiency of minimum dominating set
- Complexity aspects of polarizationless membrane systems
- P systems with active membranes: Attacking NP-complete problems
- Depth-first search with P systems
- A survey of membrane computing systems attacking hard computational problems
- Complexity classes for membrane systems
- A Membrane Algorithm for the Min Storage Problem
- scientific article; zbMATH DE number 97096 (Why is no real title available?)
- scientific article; zbMATH DE number 1735634 (Why is no real title available?)
- scientific article; zbMATH DE number 1740165 (Why is no real title available?)
- scientific article; zbMATH DE number 1958491 (Why is no real title available?)
- scientific article; zbMATH DE number 2080946 (Why is no real title available?)
- Membrane computing and one-way functions
- Simple neural-like P systems for maximal independent set selection
- Handling Markov Chains with Membrane Computing
- A Logarithmic Bound for Solving Subset Sum with P Systems
- Machines, Computations, and Universality
- On the power of computing with proteins on membranes
- Aspects of Molecular Computing
- Generating, computing and recognizing with virus machines
- From \texttt{SAT} to \texttt{SAT}-\texttt{UNSAT} using P systems with dissolution rules
- A bibliometric analysis of membrane computing (1998--2019)
- P systems and computational algebraic topology
- Universal enzymatic numerical P systems with small number of enzymatic rules
- Computing with spikes and membranes: computability and complexity in spiking neural P systems
- Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
- Non-confluence in divisionless P systems with active membranes
- Membrane fission versus cell division: when membrane proliferation is not enough
- Solving the factorization problem with P systems
- Computational complexity of tissue-like P systems
This page was built for publication: Computing with membranes: Attacking NP-complete problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707525)
