Polynomial complexity classes in spiking neural P systems

DOI10.1007/978-3-642-18123-8_27MaRDI QIDQ3067498zbMATH OpenOpenAlexFDO

Authors Petr Sosík, Alfonso Rodríguez-Patón, Lucie Ciencialová

Publication date 21 January 2011

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18123-8_27

Mathematics Subject Classification ID

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

Recommendations

• On the Computational Complexity of Spiking Neural P Systems
• On the power of families of recognizer spiking neural P systems
• On the computational complexity of spiking neural P systems
• Characterizations of some classes of spiking neural P systems
• Spiking Neural P Systems: Some Characterizations

Cited in

(8)

• Characterizations of some classes of spiking neural P systems
• On solutions and representations of spiking neural P systems with rules on synapses
• P systems attacking hard problems beyond NP: a survey
• Selected Topics in Computational Complexity of Membrane Systems
• On the power of families of recognizer spiking neural P systems
• On the Computational Complexity of Spiking Neural P Systems
• Spiking neural P systems with a generalized use of rules
• On the computational complexity of spiking neural P systems

This page was built for publication: Polynomial complexity classes in spiking neural P systems

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