Pages that link to "Item:Q5452066"
From MaRDI portal
The following pages link to Solving Numerical NP-Complete Problems with Spiking Neural P Systems (Q5452066):
Displaying 20 items.
- Spiking neural P systems with neuron division and budding (Q350918) (← links)
- On the computational complexity of spiking neural P systems (Q609034) (← links)
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources (Q974099) (← links)
- Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources (Q1035718) (← links)
- A dozen of research topics in membrane computing (Q1643136) (← links)
- Formal verification of cP systems using PAT3 and ProB (Q1982961) (← links)
- On solutions and representations of spiking neural P systems with rules on synapses (Q2224806) (← links)
- P systems attacking hard problems beyond NP: a survey (Q2299891) (← links)
- Notes on spiking neural P systems and finite automata (Q2311262) (← links)
- Uniform solutions to SAT and subset sum by spiking neural P systems (Q2655486) (← links)
- Selected Topics in Computational Complexity of Membrane Systems (Q3009341) (← links)
- Computing the Maximum Bisimulation with Spiking Neural P Systems (Q3009343) (← links)
- Spiking Neural P Systems with Weights (Q3057214) (← links)
- Spiking Neural P Systems Used as Acceptors and Transducers (Q3503887) (← links)
- On the Computational Complexity of Spiking Neural P Systems (Q3543343) (← links)
- Simple Neural-Like P Systems for Maximal Independent Set Selection (Q5378208) (← links)
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems (Q5452066) (← links)
- Matrix representation and simulation algorithm of numerical spiking neural P systems (Q6135709) (← links)
- Towards automated deduction in cP systems (Q6154793) (← links)
- Spiking neural P systems: main ideas and results (Q6177180) (← links)
