A computational complexity theory in membrane computing

DOI10.1007/978-3-642-11467-0_10MaRDI QIDQ5851902zbMATH OpenOpenAlexFDO

Authors Mario J. Pérez-Jiménez

Publication date 26 January 2010

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11467-0_10

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Membrane Computing
• Computational complexity aspects in membrane computing
• Computational complexity of tissue-like P systems
• Complexity classes for membrane systems
• Complexity classes in models of cellular computing with membranes

Cited in

(35)

• Complexity classes in models of cellular computing with membranes
• From distribution to replication in cooperative systems with active membranes: a frontier of the efficiency
• Bounding the space in P systems with active membranes
• Seeking computational efficiency boundaries: the Păun's conjecture
• A survey of results on evolution-communication P systems with energy
• Proof techniques in membrane computing
• From NP-completeness to DP-completeness: a membrane computing perspective
• On solutions and representations of spiking neural P systems with rules on synapses
• When object production tunes the efficiency of membrane systems
• P systems attacking hard problems beyond NP: a survey
• Impacts of membrane computing on theoretical computer science (extended abstract)
• Digital memcomputing: from logic to dynamics to topology
• Membrane computing to enhance time efficiency of minimum dominating set
• scientific article; zbMATH DE number 1583871 (Why is no real title available?)
• Computational tractability -- beyond Turing?
• Variants of distributed P automata and the efficient parallelizability of languages
• Complexity issues in computational biology
• Solution to motif finding problem in membranes
• Selected Topics in Computational Complexity of Membrane Systems
• On the parallelizability of languages accepted by P automata
• Deciding according to the shortest computations
• Towards “Fypercomputations” (in Membrane Computing)
• Computational complexity aspects in membrane computing
• Computational complexity of simple P systems
• P systems with proteins on membranes characterize PSPACE
• scientific article; zbMATH DE number 1738655 (Why is no real title available?)
• A limitation of cell division in tissue P systems by PSPACE
• A framework for complexity classes in membrane computing
• Membrane Computing
• Simple neural-like P systems for maximal independent set selection
• Aspects of Molecular Computing
• P colonies with agent division
• Solving 3-SAT in distributed P systems with string objects
• Symport/antiport P systems with membrane separation characterize P\textsuperscript{(\#P)}
• A quick introduction to membrane computing

This page was built for publication: A computational complexity theory in membrane computing

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