The computational complexity of tissue P systems with evolutional symport/antiport rules
From MaRDI portal
Publication:1722689
DOI10.1155/2018/3745210zbMath1407.68177OpenAlexW2802676812WikidataQ129973219 ScholiaQ129973219MaRDI QIDQ1722689
Mario J. Pérez-Jiménez, Bosheng Song, Luis Valencia-Cabrera, Lin-Qiang Pan
Publication date: 18 February 2019
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/3745210
computational complexitycomputational modelsbiochemical systemstissue P systemevolutional communication rulesmultiple individuals
Related Items (12)
Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division ⋮ Tissue P systems with evolutional communication rules with two objects in the left-hand side ⋮ The environment as a frontier of efficiency in tissue P systems with communication rules ⋮ Cell-like P systems with evolutional symport/antiport rules and membrane creation ⋮ Seeking computational efficiency boundaries: the Păun's conjecture ⋮ The computational power of cell-like P systems with one protein on membrane ⋮ Solution to PSPACE-complete problem using P systems with active membranes with time-freeness ⋮ P systems attacking hard problems beyond NP: a survey ⋮ Rule synchronization for tissue P systems ⋮ Cell-like P systems with polarizations and minimal rules ⋮ P systems with evolutional symport and membrane creation rules solving QSAT ⋮ P systems with evolutional communication and separation rules
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Flat maximal parallelism in P systems with promoters
- An unsupervised learning algorithm for membrane computing
- Efficiently solving the bin packing problem through bio-inspired mobility
- The power of communication: P systems with symport/antiport
- Computational complexity of tissue-like P systems
- Tissue P systems.
- Complexity classes in models of cellular computing with membranes
- Computing with membranes
- Tissue P systems with channel states
- Tissue-like P systems with evolutional symport/antiport rules
- Simulating P systems with membrane dissolution in a chemical calculus
- Space complexity equivalence of P systems with active membranes and Turing machines
- P systems with mobile membranes
- An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation
- Membrane Division, Oracles, and the Counting Hierarchy
- A time-free uniform solution to subset sum problem by tissue P systems with cell division
- COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES
- CELL/SYMBOL COMPLEXITY OF TISSUE P SYSTEMS WITH SYMPORT/ANTIPORT RULES
- The Efficiency of Tissue P Systems with Cell Separation Relies on the Environment
- An Overview of P-Lingua 2.0
- Characterizing Tractability by Tissue-Like P Systems
This page was built for publication: The computational complexity of tissue P systems with evolutional symport/antiport rules
