Uniform solutions to SAT and subset sum by spiking neural P systems
From MaRDI portal
Publication:2655486
Recommendations
- Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
- Solving SUBSET SUM by spiking neural P systems with pre-computed resources
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems
- Spiking Neural P Systems with Structural Plasticity: Attacking the Subset Sum Problem
- On solutions and representations of spiking neural P systems with rules on synapses
Cites work
Cited in
(36)- Solving SUBSET SUM by spiking neural P systems with pre-computed resources
- Homogeneous spiking neural P systems with structural plasticity
- Solving 3-SAT in distributed P systems with string objects
- Cell-like spiking neural P systems
- Spiking neural P systems with multiple channels
- Spiking neural P systems with neuron division and budding
- Matrix representation and simulation algorithm of spiking neural P systems with structural plasticity
- On languages generated by spiking neural P systems with weights
- Spiking Neural P Systems with Thresholds
- Small SNQ P systems with multiple types of spikes
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- Universality of spiking neural P systems with polarizations working in sequential mode induced by maximum spike number
- Computational power of dynamic threshold neural P systems for generating string languages
- A multi-objective membrane algorithm guided by the skin membrane
- Spiking neural P systems: main ideas and results
- Dynamic threshold spiking neural P systems with weights and multiple channels
- Solving the N-queens problem using dP systems with active membranes
- Spiking neural P systems with rules on synapses and anti-spikes
- A web-based visual simulator for spiking neural P systems
- Computational completeness of spiking neural P systems with inhibitory rules for generating string languages
- Turing universality of sequential spiking neural P systems with polarizations as number accepting devices
- Solving subset sum by spiking neural P systems with astrocytes producing calcium
- On the power of families of recognizer spiking neural P systems
- Spiking neural P systems with rules on synapses
- Spiking Neural P Systems with Weights
- Neural-like P systems with plasmids
- Nonlinear neural P systems for generating string languages
- Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks
- Spiking Neural P Systems with Structural Plasticity: Attacking the Subset Sum Problem
- Matrix representation and simulation algorithm of numerical spiking neural P systems
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems
- On string languages generated by sequential spiking neural P systems based on the number of spikes
- Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
- On solutions and representations of spiking neural P systems with rules on synapses
- Normal forms for spiking neural P systems and some of its variants
- The computational power of timed P systems with active membranes using promoters
This page was built for publication: Uniform solutions to SAT and subset sum by spiking neural P systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655486)
