On the power of families of recognizer spiking neural P systems
DOI10.1142/S0129054111007848zbMATH Open1213.68277OpenAlexW2069927023MaRDI QIDQ3076599FDOQ3076599
Authors: 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
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Uniform solutions to SAT and subset sum by spiking neural P systems
- Relations Among Complexity Measures
- Membrane computing. 10th international workshop, WMC 2009, Curtea de Arges, Romania, August 24--27, 2009. Revised selected and invited papers
- Simulation of Parallel Random Access Machines by Circuits
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- A universal interconnection pattern for parallel computers
- A new algorithm for regularizing one-letter context-free grammars.
Cited In (2)
This page was built for publication: On the power of families of recognizer spiking neural P systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076599)
