Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
From MaRDI portal
Publication:2003493
DOI10.1007/S11047-014-9471-4zbMath1415.68098OpenAlexW2093184455MaRDI QIDQ2003493
Bosheng Song, Tao Song, Lin-Qiang Pan
Publication date: 8 July 2019
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-014-9471-4
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (9)
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 ⋮ A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time ⋮ The computational power of timed P systems with active membranes using promoters ⋮ Time-free solution to SAT problem by tissue P systems ⋮ Computational efficiency and universality of timed P systems with membrane creation ⋮ Time-freeness and clock-freeness and related concepts in P systems ⋮ Tissue-like P systems with evolutional symport/antiport rules ⋮ Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
Cites Work
- Trading polarizations for labels in P systems with active membranes
- Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
- Tissue P systems.
- Computing with membranes
- Membrane computing. An introduction.
- Time-free solution to SAT problem using P systems with active membranes
- Further remark on P systems with active membranes and two polarizations
- COMPUTATION OF RAMSEY NUMBERS BY P SYSTEMS WITH ACTIVE MEMBRANES
- Membrane Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
