Solving Numerical NP-Complete Problems with Spiking Neural P Systems

DOI10.1007/978-3-540-77312-2_21MaRDI QIDQ5452066zbMATH OpenOpenAlexFDO

Authors Alberto Leporati, Claudio Zandron, Claudio Ferretti, Giancarlo Mauri

Publication date 28 March 2008

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77312-2_21

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

• Solving SUBSET SUM by spiking neural P systems with pre-computed resources
• Uniform solutions to SAT and subset sum by spiking neural P systems
• Solving NP-complete problems by spiking neural P systems with budding rules
• Spiking Neural P Systems with Structural Plasticity: Attacking the Subset Sum Problem
• Spiking neural P systems

Cites work

• Computing with membranes
• Computing with Spiking Neural P Systems: Traces and Small Universal Systems
• scientific article; zbMATH DE number 1583885 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2089984 (Why is no real title available?)
• Membrane computing. An introduction.
• Normal forms for spiking neural P systems
• P SYSTEMS WITH INPUT IN BINARY FORM
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• SPIKE TRAINS IN SPIKING NEURAL P SYSTEMS
• Spiking neural P systems

Cited in

(25)

• Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
• A dozen of research topics in membrane computing
• Formal verification of cP systems using PAT3 and ProB
• On solutions and representations of spiking neural P systems with rules on synapses
• P systems attacking hard problems beyond NP: a survey
• Notes on spiking neural P systems and finite automata
• Uniform solutions to SAT and subset sum by spiking neural P systems
• Spiking Neural P Systems with Structural Plasticity: Attacking the Subset Sum Problem
• Selected Topics in Computational Complexity of Membrane Systems
• Computing the Maximum Bisimulation with Spiking Neural P Systems
• Spiking Neural P Systems with Weights
• Spiking Neural P Systems Used as Acceptors and Transducers
• Spiking neural P systems with neuron division and budding
• On the Computational Complexity of Spiking Neural P Systems
• Solving SUBSET SUM by spiking neural P systems with pre-computed resources
• scientific article; zbMATH DE number 1748486 (Why is no real title available?)
• Simple neural-like P systems for maximal independent set selection
• Some Open Problems about Catalytic, Numerical, and Spiking Neural P Systems
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• Solving NP-complete problems by spiking neural P systems with budding rules
• On the computational complexity of spiking neural P systems
• Matrix representation and simulation algorithm of numerical spiking neural P systems
• Towards automated deduction in cP systems
• Spiking neural P systems: main ideas and results
• Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources

This page was built for publication: Solving Numerical NP-Complete Problems with Spiking Neural P Systems

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