Bounding the space in P systems with active membranes
From MaRDI portal
(Redirected from Publication:1982967)
Recommendations
Cites work
- scientific article; zbMATH DE number 1583885 (Why is no real title available?)
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 2118901 (Why is no real title available?)
- A Turing machine simulation by P systems without charges
- A computational complexity theory in membrane computing
- A gap in the space hierarchy of P systems with active membranes
- A new method to simulate restricted variants of polarizationless P systems with active membranes
- A toolbox for simpler active membrane algorithms
- Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
- Characterising the complexity of tissue P systems with fission rules
- Characterizing PSPACE with shallow non-confluent P systems
- Complexity aspects of polarizationless membrane systems
- Complexity classes for membrane systems
- Computational efficiency of minimal cooperation and distribution in polarizationless P systems with active membranes
- Constant-space P systems with active membranes
- Membrane Computing
- Membrane Computing
- Membrane computing and complexity theory: A characterization of PSPACE
- Membrane division, oracles, and the counting hierarchy
- Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
- Monodirectional P systems
- Non-confluence in divisionless P systems with active membranes
- On the power of computing with proteins on membranes
- On uniformity within \(NC^ 1\)
- P systems attacking hard problems beyond NP: a survey
- P systems simulating oracle computations
- P systems with active membranes working in polynomial space
- P systems with active membranes: Attacking NP-complete problems
- P systems with active membranes: Trading time for space
- P Systems with Elementary Active Membranes: Beyond NP and coNP
- Reaching efficiency through collaboration in membrane systems: dissolution, polarization and cooperation
- Shallow laconic P-systems can count
- Shallow non-confluent P systems
- Simulating elementary active membranes
- Solving QSAT in sublinear depth
- Solving the subset-problem by P systems with active membrans
- Space complexity equivalence of P systems with active membranes and Turing machines
- Sublinear-space P systems with active membranes
- The computational power of cell division in P systems: Beating down parallel computers?
- The computational power of membrane systems under tight uniformity conditions
- Theoretical Aspects of Computing - ICTAC 2004
- Trading polarizations for labels in P systems with active membranes
Cited in
(16)- Constant-space P systems with active membranes
- Alternative space definitions for P systems with active membranes
- Description of membrane systems with time Petri nets: promoters/inhibitors, membrane dissolution, and priorities
- Proof techniques in membrane computing
- Spiking neural P systems with target indications
- On the universality of P systems with membrane creation
- On maximal parallel application of rules in rewriting P systems
- Machines, Computations, and Universality
- Rule synchronization for tissue P systems
- scientific article; zbMATH DE number 6665229 (Why is no real title available?)
- Evaluating space measures in P systems
- On the power of P systems with active membranes using weak non-elementary membrane division
- Time-free solution to independent set problem using P systems with active membranes
- P Systems with Active Membranes Working in Sublinear Space
- P Systems with Elementary Active Membranes: Beyond NP and coNP
- P systems with active membranes working in polynomial space
This page was built for publication: Bounding the space in P systems with active membranes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1982967)
