Proof techniques in membrane computing
From MaRDI portal
Publication:1998880
Recommendations
- Strategy-based proof calculus for membrane systems
- A computational complexity theory in membrane computing
- Turing computability and membrane computing
- A framework for complexity classes in membrane computing
- Membrane Computing
- AN APPROACH TO MEMBRANE COMPUTING UNDER INEXACTITUDE
- Impacts of membrane computing on theoretical computer science (extended abstract)
- Computational complexity aspects in membrane computing
- Membrane Computing
- Operational semantics and rewriting logic in membrane computing
Cites work
- A polynomial complexity class in P systems using membrane division
- An improved universal spiking neural P system with generalized use of rules
- Bounding the space in P systems with active membranes
- Characterizing PSPACE with shallow non-confluent P systems
- Characterizing tractability by tissue-like P systems
- Computing with membranes
- 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
- How derivation modes and halting conditions may influence the computational power of P systems
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 1735649 (Why is no real title available?)
- scientific article; zbMATH DE number 1951597 (Why is no real title available?)
- scientific article; zbMATH DE number 2013807 (Why is no real title available?)
- Membrane Computing
- Membrane Computing
- Membrane Computing
- Membrane fission versus cell division: when membrane proliferation is not enough
- Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
- P systems with active membranes: Attacking NP-complete problems
- P systems with proteins: a new frontier when membrane division disappears
- Recent complexity-theoretic results on P systems with active membranes
- Shallow laconic P-systems can count
- Small (purely) catalytic P systems simulating register machines
- Uniform Solution of QSAT Using Polarizationless Active Membranes
This page was built for publication: Proof techniques in membrane computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998880)
