Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources

DOI10.1007/s11047-008-9081-0zbMath1187.68239OpenAlexW1975784677MaRDI QIDQ1035718

Alberto Leporati, Tseren-Onolt Ishdorj

Publication date: 4 November 2009

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-008-9081-0

zbMATH Keywords

membrane computingSATspiking neural P systems3-SATpre-computed resourses

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (11)

Towards “Fypercomputations” (in Membrane Computing) ⋮ Computational completeness of spiking neural P systems with inhibitory rules for generating string languages ⋮ Spiking neural P systems with neuron division and budding ⋮ Some wonders of a bio-computer-scientist ⋮ Spiking neural P systems: main ideas and results ⋮ Solving subset sum by spiking neural P systems with astrocytes producing calcium ⋮ Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons ⋮ An error-tolerant serial binary full-adder via a spiking neural P system using HP/LP basic neurons ⋮ RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS ⋮ Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources ⋮ Matrix representation and simulation algorithm of spiking neural P systems with structural plasticity

Cites Work

• Normal forms for spiking neural P systems
• A guide to membrane computing.
• Spiking Neuron Models
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources