Solving a PSPACE-complete problem with cP systems
Henderson, Alec, Nicolescu, Radu, and Dinneen, Michael J. (2020) Solving a PSPACE-complete problem with cP systems. Journal of Membrane Computing, 2 (4). pp. 311-322.
![[img]](https://researchonline.jcu.edu.au/style/images/fileicons/application_pdf.png) |
PDF (Published Version)
- Published Version
Restricted to Repository staff only |
Abstract
There have been a few NP-hard problems solved using cP systems including the travelling salesman problem. However, these problems are typically in NP rather than higher in the polynomial time hierarchy. In this paper, we solve QSAT (also known as TQBF), which is a well-known PSPACE-complete problem. Compared to other extant confluent P systems solutions, our deterministic cP solution only uses a small constant number of custom alphabet symbols (19), a small constant number of rules (10) and a small constant upper limit of membrane nesting depth (6), independent of the problem size.
| Item ID: | 75512 |
|---|---|
| Item Type: | Article (Research - C1) |
| ISSN: | 2523-8914 |
| Keywords: | Computational complexity, cP systems, Membrane computing |
| Copyright Information: | © Springer Nature Singapore Pte Ltd. 2020 |
| Date Deposited: | 19 Jul 2022 22:59 |
| FoR Codes: | 46 INFORMATION AND COMPUTING SCIENCES > 4613 Theory of computation > 461302 Computational complexity and computability @ 20% 46 INFORMATION AND COMPUTING SCIENCES > 4613 Theory of computation > 461399 Theory of computation not elsewhere classified @ 80% |
| SEO Codes: | 28 EXPANDING KNOWLEDGE > 2801 Expanding knowledge > 280115 Expanding knowledge in the information and computing sciences @ 100% |
| Downloads: |
Total: 1 |
| More Statistics |
Actions (Repository Staff Only)
 |
Item Control Page |