Polynomial Complexity Classes in Spiking Neural P Systems

DOI10.1007/978-3-642-18123-8_27zbMath1259.68074OpenAlexW1518170198MaRDI QIDQ3067498

Alfonso Rodríguez-Patón, Petr Sosík, 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)

Related Items (4)

Spiking Neural P Systems with a Generalized Use of Rules ⋮ On solutions and representations of spiking neural P systems with rules on synapses ⋮ Selected Topics in Computational Complexity of Membrane Systems ⋮ P systems attacking hard problems beyond NP: a survey

This page was built for publication: Polynomial Complexity Classes in Spiking Neural P Systems