Computational efficiency and universality of timed P systems with active membranes

DOI10.1016/J.TCS.2014.10.051MaRDI QIDQ487991zbMATHOpenAlexFDO

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

zbMATH Keywords

membrane computingSATP systemuniversalityactive membranetime-free solution

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(15)

• Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
• Tissue-like P systems with evolutional symport/antiport rules
• Time-free solution to SAT problem by tissue P systems
• Time-freeness and clock-freeness and related concepts in P systems
• A Prolog simulator for deterministic P systems with active membranes
• FURTHER RESULTS ON TIME-FREE P SYSTEMS
• Time-free solution to independent set problem using P systems with active membranes
• Membrane Computing
• The computational power of enzymatic numerical P systems working in the sequential mode
• Computational efficiency and universality of timed P systems with membrane creation
• The computational power of timed P systems with active membranes using promoters
• 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
• An efficient time-free solution to SAT problem by P systems with proteins on membranes
• scientific article; zbMATH DE number 7318976 (Why is no real title available?)

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)