Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
type: Item
instance of: scholarly article
title: Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
zbMATH Open document ID: 1208.68172
author: Tseren-Onolt Ishdorj
author: Alberto Leporati
author: XiangXiang Zeng
author: Xingyi Zhang
author: Linqiang Pan
published in: Theoretical Computer Science
publication date: 2010-05-27T00:00:00Z
full work available at URL: https://idus.us.es/xmlui/handle/11441/38898
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 5712814
zbMATH Keywords: spiking neural P systems
zbMATH Keywords: PSPACE-complete problems
zbMATH Keywords: QSAT
zbMATH Keywords: Q3SAT
MaRDI profile type: Publication
OpenAlex ID: W1996796733
cites work: Q3692867
cites work: Q3425575
cites work: Spiking neural P systems with extended rules: universality and languages
cites work: Two-Processor Scheduling with Start-Times and Deadlines
cites work: Q5480659
cites work: Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
cites work: Q3601856
cites work: Solving Numerical NP-Complete Problems with Spiking Neural P Systems
cites work: Computing with membranes
cites work: Membrane computing. An introduction.
cites work: Q5678435
cites work: Small Semi-weakly Universal Turing Machines
DOI: 10.1016/J.TCS.2010.01.019
description: scientific article; zbMATH DE number 5712814