P systems with active membranes: Attacking NP-complete problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- From distribution to replication in cooperative systems with active membranes: a frontier of the efficiency
- The counting power of P systems with antimatter
- Design patterns for efficient solutions to NP-complete problems in membrane computing
- A uniform solution to the independent set problem through tissue P systems with cell separation
- A guide to membrane computing.
- Breaking DES using P systems.
- On the power of membrane division in P systems
- From regulated rewriting to computing with membranes: collapsing hierarchies
- The conformon-P system: a molecular and cell biology-inspired computability model
- A Turing machine simulation by P systems without charges
- Tissue P systems with promoter simulation with MeCoSim and P-Lingua framework
- Bounding the space in P systems with active membranes
- Coping with dynamical reaction system topologies using deterministic P modules: a case study of photosynthesis
- 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
- Shallow laconic P-systems can count
- A new method to simulate restricted variants of polarizationless P systems with active membranes
- Proof techniques in membrane computing
- Spiking neural P systems with target indications
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- The computational power of monodirectional tissue P systems with symport rules
- Morphogenetic systems for resource bounded computation and modeling
- Depth-two P systems can simulate Turing machines with \textbf{NP} oracles
- P systems with evolutional symport and membrane creation rules solving QSAT
- P systems with evolutional communication and separation rules
- 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
- P systems with symport/antiport rules: when do the surroundings matter?
- When object production tunes the efficiency of membrane systems
- Tissue-like P systems with evolutional symport/antiport rules
- Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
- Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
- P systems attacking hard problems beyond NP: a survey
- Cell-like P systems with polarizations and minimal rules
- Monodirectional P systems
- P systems based computing polynomials: design and formal verification
- Cell-like spiking neural P systems with evolution rules
- Adaptive P systems
- Characterising the complexity of tissue P systems with fission rules
- A path to computational efficiency through membrane computing
- Time-free solution to SAT problem using P systems with active membranes
- Space complexity equivalence of P systems with active membranes and Turing machines
- P systems with mobile membranes
- Solving the subset-problem by P systems with active membrans
- Solving HPP and SAT by P systems with active membranes and separation rules
- \(P\) systems with active membranes and without polarizations
- A fast \(P\) system for finding a balanced 2-partition
- Complexity aspects of polarizationless membrane systems
- Some wonders of a bio-computer-scientist
- scientific article; zbMATH DE number 1583877 (Why is no real title available?)
- scientific article; zbMATH DE number 1583879 (Why is no real title available?)
- scientific article; zbMATH DE number 1583885 (Why is no real title available?)
- Uniform solution to common algorithmic problem by P systems working in the minimally parallel mode
- P systems with active membranes operating under minimal parallelism
- Evolutionary design of a simple membrane system
- Formal verification of P systems with active membranes through model checking
- 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
- Depth-first search with P systems
- P Systems with Elementary Active Membranes: Beyond NP and coNP
- Towards “Fypercomputations” (in Membrane Computing)
- P SYSTEMS WITH INPUT IN BINARY FORM
- On the efficiency of cell-like and tissue-like recognizing membrane systems
- On the Computational Power of Enhanced Mobile Membranes
- A Biologically Inspired Model with Fusion and Clonation of Membranes
- A Characterisation of NL Using Membrane Systems without Charges and Dissolution
- Simple, Enhanced and Mutual Mobile Membranes
- P systems with proteins on membranes characterize PSPACE
- Accelerated execution of P systems with active membranes to solve the N-queens problem
- Asynchronous P systems with active membranes
- scientific article; zbMATH DE number 1735634 (Why is no real title available?)
- scientific article; zbMATH DE number 1735640 (Why is no real title available?)
- scientific article; zbMATH DE number 1740165 (Why is no real title available?)
- scientific article; zbMATH DE number 1951573 (Why is no real title available?)
- scientific article; zbMATH DE number 1951574 (Why is no real title available?)
- scientific article; zbMATH DE number 1951583 (Why is no real title available?)
- scientific article; zbMATH DE number 1951585 (Why is no real title available?)
- scientific article; zbMATH DE number 1951597 (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?)
- A linear time complexity of breadth-first search using P system with membrane division
- The computational power of timed P systems with active membranes using promoters
- A limitation of cell division in tissue P systems by PSPACE
- scientific article; zbMATH DE number 2118901 (Why is no real title available?)
- Computational efficiency and universality of timed P systems with active membranes
- Time-free solution to independent set problem using P systems with active membranes
- Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
- Defining and Executing P Systems with Structured Data in K
- A \(\Sigma_2^{\mathrm P} \cup \Pi_2^{\mathrm P}\) lower bound using mobile membranes
- Computational efficiency and universality of timed P systems with membrane creation
- A toolbox for simpler active membrane algorithms
- P systems with active membranes: Trading time for space
- Simple neural-like P systems for maximal independent set selection
- The computational power of membrane systems under tight uniformity conditions
- Enhanced mobile membranes: computability results
- Active membranes, proteins on membranes, tissue P systems: complexity-related issues and challenges
This page was built for publication: P systems with active membranes: Attacking NP-complete problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708469)
