Computational complexity of simple P systems

zbMATH Open1154.68050MaRDI QIDQ3601855FDOQ3601855

Authors: Gabriel Ciobanu, Andreas Resios 

Publication date: 12 February 2009

Recommendations

• Computational complexity of tissue-like P systems
• Membrane Computing
• A computational complexity theory in membrane computing
• Complexity classes in models of cellular computing with membranes
• Complexity classes for membrane systems: a survey

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (4)

• Title not available (Why is that?)
• Complexity of evolution in maximum cooperative P systems
• Membrane Computing
• Spiking neural P systems with polarizations and rules on synapses

This page was built for publication: Computational complexity of simple P systems

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