Solving NP-complete problems by spiking neural P systems with budding rules

DOI10.1007/978-3-642-11467-0_24MaRDI QIDQ5851917zbMATH OpenOpenAlexFDO

Authors Tseren-Onolt Ishdorj, Alberto Leporati, Jun Wang, Linqiang Pan

Publication date 26 January 2010

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11467-0_24

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)

Recommendations

• scientific article; zbMATH DE number 5666711
• Spiking neural P systems with neuron division and budding
• Spiking Neural P Systems with Neuron Division
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources

Cited in

(8)

• Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
• Cell-like spiking neural P systems
• Computing the Maximum Bisimulation with Spiking Neural P Systems
• Spiking neural P systems with neuron division and budding
• Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• Communication P systems on simplicial complexes with applications in cluster analysis
• Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources

This page was built for publication: Solving NP-complete problems by spiking neural P systems with budding rules

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