Spiking Neural P Systems with Structural Plasticity: Attacking the Subset Sum Problem
From MaRDI portal
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Recommendations
- Solving SUBSET SUM by spiking neural P systems with pre-computed resources
- Uniform solutions to SAT and subset sum by spiking neural P systems
- Spiking neural P systems with structural plasticity and anti-spikes
- Homogeneous spiking neural P systems with structural plasticity
- Spiking neural P systems: theoretical results and applications
- On spiking neural P systems
- Asynchronous spiking neural P systems with structural plasticity
- Spiking neural P systems: main ideas and results
- SPIKING NEURAL P SYSTEMS: AN EARLY SURVEY
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems
Cited in
(7)- Solving SUBSET SUM by spiking neural P systems with pre-computed resources
- Solving the N-queens problem using dP systems with active membranes
- Uniform solutions to SAT and subset sum by spiking neural P systems
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems
- Spiking neural P systems with structural plasticity and mute rules
- On solutions and representations of spiking neural P systems with rules on synapses
- Asynchronous spiking neural P systems with structural plasticity
This page was built for publication: Spiking Neural P Systems with Structural Plasticity: Attacking the Subset Sum Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789123)