ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL P SYSTEMS

DOI10.1142/S0129054111007848zbMath1213.68277OpenAlexW2069927023MaRDI QIDQ3076599

Petr Sosík, Alfonso Rodríguez-Patón, Luděk Cienciala

Publication date: 23 February 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111007848

zbMATH Keywords

computational complexityP systemspiking neural P system

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Selected Topics in Computational Complexity of Membrane Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
• A new algorithm for regularizing one-letter context-free grammars.
• Membrane computing. 10th international workshop, WMC 2009, Curtea de Arges, Romania, August 24--27, 2009. Revised selected and invited papers
• Uniform solutions to SAT and subset sum by spiking neural P systems
• Simulation of Parallel Random Access Machines by Circuits
• A universal interconnection pattern for parallel computers
• Relations Among Complexity Measures

This page was built for publication: ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL P SYSTEMS