Computational efficiency and universality of timed P systems with membrane creation

DOI10.1007/s00500-015-1732-3zbMath1359.68076OpenAlexW1498574646MaRDI QIDQ521731

Bosheng Song, Mario J. Pérez-Jiménez, Lin-Qiang Pan

Publication date: 12 April 2017

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/109101

zbMATH Keywords

universalitySAT problemP systemtime-free solutionmembrane creation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

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, The computational power of cell-like P systems with one protein on membrane, Tissue-like P systems with evolutional symport/antiport rules, Solution to PSPACE-complete problem using P systems with active membranes with time-freeness, Cell-like spiking neural P systems with evolution rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational efficiency and universality of timed P systems with active membranes
• Spiking neural P systems: an improved normal form
• A uniform solution to SAT using membrane creation
• Computing with membranes
• Time-free solution to Hamilton path problems using P systems with \(d\)-division
• Membrane computing. An introduction.
• Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
• Time-free solution to SAT problem using P systems with active membranes
• A time-free uniform solution to subset sum problem by tissue P systems with cell division
• Time-Free Spiking Neural P Systems
• Membrane Computing
• RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
• Membrane Computing