P systems attacking hard problems beyond NP: a survey
From MaRDI portal
Recommendations
- A survey of membrane computing systems attacking hard computational problems
- Active membranes, proteins on membranes, tissue P systems: complexity-related issues and challenges
- scientific article; zbMATH DE number 1583871
- Complexity aspects of polarizationless membrane systems
- P systems with active membranes: Attacking NP-complete problems
Cites work
- A computational complexity theory in membrane computing
- A time-free uniform solution to subset sum problem by tissue P systems with cell division
- Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
- Alternation
- An efficient simulation of polynomial-space Turing machines by P systems with active membranes
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- An optimal frontier of the efficiency of tissue P systems with cell separation
- Cell communication in tissue \(P\) systems: universality results
- Characterising the complexity of tissue P systems with fission rules
- Characterizing tractability by tissue-like P systems
- Complexity aspects of polarizationless membrane systems
- Complexity classes for membrane systems: a survey
- Complexity classes in models of cellular computing with membranes
- Computational complexity of P systems with active membranes
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- Developments in Language Theory
- Efficient simulation of tissue-like P systems by transition cell-like P systems
- From distribution to replication in cooperative systems with active membranes: a frontier of the efficiency
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 47903 (Why is no real title available?)
- scientific article; zbMATH DE number 1951592 (Why is no real title available?)
- scientific article; zbMATH DE number 2089984 (Why is no real title available?)
- scientific article; zbMATH DE number 2118901 (Why is no real title available?)
- Limits of the power of tissue P systems with cell division
- Membrane Computing
- Membrane computing and complexity theory: A characterization of PSPACE
- Membrane computing. 10th international workshop, WMC 2009, Curtea de Arges, Romania, August 24--27, 2009. Revised selected and invited papers
- Membrane computing. 13th international conference, CMC 2012, Budapest, Hungary, August 28--31, 2012. Revised selected papers
- Membrane computing. 8th international workshop, WMC 2007 Thessaloniki, Greece, June 25--28, 2007. Revised selected and invited papers
- Membrane division, oracles, and the counting hierarchy
- Non-confluence in divisionless P systems with active membranes
- On Flip-Flop Membrane Systems with Proteins
- On the computational efficiency of polarizationless recognizer P systems with strong division and dissolution
- On the Computational Power of Flip-Flop Proteins on Membranes
- P systems simulating oracle computations
- P systems with active membranes: Attacking NP-complete problems
- P systems with proteins on membranes
- P Systems with Proteins on Membranes and Membrane Division
- P systems with proteins on membranes characterize PSPACE
- Polynomial complexity classes in spiking neural P systems
- P Systems with Elementary Active Membranes: Beyond NP and coNP
- Selected Topics in Computational Complexity of Membrane Systems
- Shallow non-confluent P systems
- Simulating elementary active membranes
- Solving a special case of the P conjecture using dependency graphs with dissolution
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems
- Solving QSAT in sublinear depth
- Space complexity equivalence of P systems with active membranes and Turing machines
- Spiking neural P systems
- Spiking neural P systems with neuron division and budding
- The computational complexity of tissue P systems with evolutional symport/antiport rules
- The computational power of membrane systems under tight uniformity conditions
- The efficiency of tissue P systems with cell separation relies on the environment
- The power of communication: P systems with symport/antiport
- Time-free solution to SAT problem using P systems with active membranes
- Tissue P systems with cell separation: upper bound by PSPACE
- Tissue P systems with channel states
- Tissue P systems.
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems
Cited in
(34)- Design patterns for efficient solutions to NP-complete problems in membrane computing
- 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
- Description of membrane systems with time Petri nets: promoters/inhibitors, membrane dissolution, and priorities
- Alternative space definitions for P systems with active membranes
- Spiking neural P systems with target indications
- Rule synchronization for tissue P systems
- Depth-two P systems can simulate Turing machines with \textbf{NP} oracles
- P systems with evolutional symport and membrane creation rules solving QSAT
- Turing completeness of water computing
- On the power of P systems with active membranes using weak non-elementary membrane division
- From NP-completeness to DP-completeness: a membrane computing perspective
- Cell-like P systems with evolutional symport/antiport rules and membrane creation
- A survey of membrane computing systems attacking hard computational problems
- Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
- Computational complexity of P systems with active membranes
- Active membranes, proteins on membranes, tissue P systems: complexity-related issues and challenges
- Sublinear P system solutions to NP-complete problems
- P colonies with agent division
- A bibliometric analysis of membrane computing (1998--2019)
- On the power of membrane dissolution in polarizationless P systems with active membranes
- Active P-colonies
- A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules
- Evaluating space measures in P systems
- Spiking neural P systems: main ideas and results
- A distributed adaptive optimization spiking neural P system for approximately solving combinatorial optimization problems
- On maximal parallel application of rules in rewriting P systems
- An overview on applications of spiking neural networks and spiking neural p systems
- On P colonies and virus machines
- Homogeneous spiking neural P systems with synaptic failure
- Solving SAT by restricted spiking neural P systems with temporal division rules
- Symport/antiport P systems with membrane separation characterize P\textsuperscript{(\#P)}
This page was built for publication: P systems attacking hard problems beyond NP: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299891)
