Computational complexity of tissue-like P systems
From MaRDI portal
Publication:983185
DOI10.1016/j.jco.2010.03.001zbMath1195.68050OpenAlexW2065714916MaRDI QIDQ983185
Mario J. Pérez-Jiménez, Lin-Qiang Pan
Publication date: 3 August 2010
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2010.03.001
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (35)
Computing with viruses ⋮ An efficient time-free solution to SAT problem by P systems with proteins on membranes ⋮ The computational power of tissue-like P systems with promoters ⋮ Probabilistic Guarded P Systems, A New Formal Modelling Framework ⋮ Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division ⋮ Characterising the complexity of tissue P systems with fission rules ⋮ An efficient time-free solution to QSAT problem using P systems with proteins on membranes ⋮ A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time ⋮ A path to computational efficiency through membrane computing ⋮ Membrane fission versus cell division: when membrane proliferation is not enough ⋮ A bibliometric analysis of membrane computing (1998--2019) ⋮ A time-free uniform solution to subset sum problem by tissue P systems with cell division ⋮ Shallow Non-confluent P Systems ⋮ Simple Neural-Like P Systems for Maximal Independent Set Selection ⋮ A linear time complexity of breadth-first search using P system with membrane division ⋮ The computational complexity of tissue P systems with evolutional symport/antiport rules ⋮ A limitation of cell division in tissue P systems by PSPACE ⋮ The computational power of timed P systems with active membranes using promoters ⋮ Tissue P systems with promoter simulation with MeCoSim and P-Lingua framework ⋮ Seeking computational efficiency boundaries: the Păun's conjecture ⋮ The computational power of cell-like P systems with one protein on membrane ⋮ RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS ⋮ Computational power of cell separation in tissue P systems ⋮ Time-free solution to SAT problem by tissue P systems ⋮ A uniform solution to the independent set problem through tissue P systems with cell separation ⋮ A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM ⋮ Tissue P systems with cell separation: attacking the partition problem ⋮ P systems with symport/antiport rules: when do the surroundings matter? ⋮ Tissue-like P systems with evolutional symport/antiport rules ⋮ Rule synchronization for tissue P systems ⋮ The computational power of monodirectional tissue P systems with symport rules ⋮ Monodirectional tissue P systems with channel states ⋮ Cell-like P systems with polarizations and minimal rules ⋮ A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division ⋮ Solving the 3-COL problem by using tissue P systems without environment and proteins on cells
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The power of communication: P systems with symport/antiport
- Tissue P systems.
- Computing with membranes
- Tissue P systems with channel states
- Membrane computing. An introduction.
- Cell communication in tissue \(P\) systems: universality results
- Computing with Cells
- A CHARACTERIZATION OF PARIKH SETS OF ET0L LANGUAGES IN TERMS OF P SYSTEMS
- Developments in Language Theory
- Membrane Computing
- Membrane Computing
- Aspects of Molecular Computing
This page was built for publication: Computational complexity of tissue-like P systems
