Solving a PSPACE-complete problem with cP systems
type: Item
instance of: scholarly article
title: Solving a PSPACE-complete problem with cP systems
zbMATH Open document ID: 1469.68036
author: Alec Henderson
author: Radu Nicolescu
author: Michael J. Dinneen
published in: Journal of Membrane Computing
publication date: 2021-09-14T00:00:00Z
Mathematics Subject Classification ID: 68Q07
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 7395476
zbMATH Keywords: membrane computing
zbMATH Keywords: cP-systems
zbMATH Keywords: computational complexity
MaRDI profile type: MaRDI publication profile
full work available at URL: s41965-020-00064-w
OpenAlex ID: W3104027319
cites work: Computing with membranes
cites work: P systems with active membranes: Attacking NP-complete problems
cites work: Q5480659
cites work: Tissue P systems.
cites work: The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
cites work: Actor-like cP systems
cites work: Formal verification of cP systems using PAT3 and ProB
cites work: Characterizing PSPACE with shallow non-confluent P systems
cites work: Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
cites work: Solving QSAT in sublinear depth
cites work: Membrane Computing
cites work: Uniform Solution of QSAT Using Polarizationless Active Membranes
cites work: An introduction to \(\mathrm{cP}\) systems
cites work: Q3392275
cites work: Alternation
cites work: Parallel Thinning with Complex Objects and Actors
DOI: 10.1007/S41965-020-00064-W
description: scientific article; zbMATH DE number 7395476