Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
From MaRDI portal
Publication:974099
DOI10.1016/j.tcs.2010.01.019zbMath1208.68172OpenAlexW1996796733MaRDI QIDQ974099
Tseren-Onolt Ishdorj, Xiangxiang Zeng, Xingyi Zhang, Alberto Leporati, Lin-Qiang Pan
Publication date: 27 May 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/xmlui/handle/11441/38898
Learning and adaptive systems in artificial intelligence (68T05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (32)
Computational completeness of spiking neural P systems with inhibitory rules for generating string languages ⋮ Spiking neural P systems with a flat maximally parallel use of rules ⋮ Spiking neural P systems with rules on synapses and anti-spikes ⋮ Reversible spiking neural P systems ⋮ Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem ⋮ The power of synchronizing rules in membrane computing ⋮ Universality of spiking neural P systems with polarizations working in sequential mode induced by maximum spike number ⋮ A bibliometric analysis of membrane computing (1998--2019) ⋮ Turing universality of sequential spiking neural P systems with polarizations as number accepting devices ⋮ Spiking neural P systems with polarizations and astrocytes ⋮ Spiking neural P systems: main ideas and results ⋮ Spiking neural P systems with rules on synapses ⋮ Simple Neural-Like P Systems for Maximal Independent Set Selection ⋮ On Some Classes of Sequential Spiking Neural P Systems ⋮ Cell-like P systems with evolutional symport/antiport rules and membrane creation ⋮ A linear time complexity of breadth-first search using P system with membrane division ⋮ Spiking Neural P Systems with Thresholds ⋮ Spiking Neural P Systems with a Generalized Use of Rules ⋮ Solving a PSPACE-complete problem with cP systems ⋮ Homogeneous spiking neural P systems with structural plasticity ⋮ An error-tolerant serial binary full-adder via a spiking neural P system using HP/LP basic neurons ⋮ An improved universal spiking neural P system with generalized use of rules ⋮ Selected Topics in Computational Complexity of Membrane Systems ⋮ RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS ⋮ On string languages generated by sequential spiking neural P systems based on the number of spikes ⋮ Communication P systems on simplicial complexes with applications in cluster analysis ⋮ ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL P SYSTEMS ⋮ Matrix representation and simulation algorithm of spiking neural P systems with structural plasticity ⋮ P systems attacking hard problems beyond NP: a survey ⋮ An improved dynamic membrane evolutionary algorithm for constrained engineering design problems ⋮ P systems with evolutional symport and membrane creation rules solving QSAT ⋮ Homogeneous spiking neural P systems working in sequential mode induced by maximum spike number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spiking neural P systems with extended rules: universality and languages
- Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
- Computing with membranes
- Membrane computing. An introduction.
- Small Semi-weakly Universal Turing Machines
- Two-Processor Scheduling with Start-Times and Deadlines
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems
This page was built for publication: Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
