Solving a PSPACE-complete problem with cP systems
DOI10.1007/S41965-020-00064-WzbMATH Open1469.68036OpenAlexW3104027319MaRDI QIDQ1982985FDOQ1982985
Radu Nicolescu, Alec Henderson, Michael J. Dinneen
Publication date: 14 September 2021
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-020-00064-w
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing with membranes
- Tissue P systems.
- Alternation
- Formal verification of cP systems using PAT3 and ProB
- P systems with active membranes: Attacking NP-complete problems
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- Membrane Computing
- An introduction to \(\mathrm{cP}\) systems
- The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
- Characterizing PSPACE with shallow non-confluent P systems
- Actor-like cP systems
- Solving QSAT in sublinear depth
- Parallel Thinning with Complex Objects and Actors
Cited In (7)
- A sublinear Sudoku solution in cP systems and its formal verification
- Neighbourhood message passing computation on a lattice with cP systems
- Towards automated deduction in cP systems
- Formal verification of cP systems using Coq
- Sublinear P system solutions to NP-complete problems
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Spiking neural P systems with polarizations and astrocytes
This page was built for publication: Solving a PSPACE-complete problem with cP systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1982985)
