Computational efficiency and universality of timed P systems with active membranes

DOI10.1016/J.TCS.2014.10.051zbMATH Open1314.68130OpenAlexW1968290756MaRDI QIDQ487991FDOQ487991

Authors: Bosheng Song, Linqiang Pan 

Publication date: 23 January 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.051

Recommendations

• Computational efficiency and universality of timed P systems with membrane creation
• Time-free solution to SAT problem using P systems with active membranes
• The computational power of timed P systems with active membranes using promoters
• Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
• Solution to PSPACE-complete problem using P systems with active membranes with time-freeness

zbMATH Keywords

membrane computingSATP systemuniversalityactive membranetime-free solution

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• Computing with membranes
• Membrane computing. An introduction.
• Title not available (Why is that?)
• Tissue P systems.
• A polynomial complexity class in P systems using membrane division
• Spiking neural P systems
• Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
• Time-free solution to SAT problem using P systems with active membranes
• Membrane Computing
• P systems with active membranes: Attacking NP-complete problems
• Title not available (Why is that?)
• Time-free spiking neural P systems
• Further remark on P systems with active membranes and two polarizations
• Computation of Ramsey numbers by P systems with active membranes
• Title not available (Why is that?)
• RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS

Cited In (13)

• Time-free solution to SAT problem by tissue P systems
• Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
• 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
• FURTHER RESULTS ON TIME-FREE P SYSTEMS
• Computational efficiency and universality of timed P systems with membrane creation
• A Prolog simulator for deterministic P systems with active membranes
• Tissue-like P systems with evolutional symport/antiport rules
• Title not available (Why is that?)
• A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time
• The computational power of enzymatic numerical P systems working in the sequential mode
• Membrane Computing
• The computational power of timed P systems with active membranes using promoters

This page was built for publication: Computational efficiency and universality of timed P systems with active membranes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487991)