dc.contributor.author |
Nicolescu, Radu |
en |
dc.contributor.author |
Henderson, Alec |
en |
dc.contributor.author |
Dinneen, Michael |
en |
dc.date.accessioned |
2020-09-13T22:33:16Z |
en |
dc.date.available |
2020-09-13T22:33:16Z |
en |
dc.date.issued |
2020-07-15 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-545 (2020) |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/52812 |
en |
dc.description.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. |
en |
dc.publisher |
Centre for Discrete Mathematics and Theoretical Computer Science |
en |
dc.relation.ispartofseries |
CDMTCS Reports Series |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
Solving a PSPACE-complete Problem with cP Systems |
en |
dc.type |
Report |
en |
dc.rights.holder |
Copyright: The authors |
en |
pubs.author-url |
https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/view-publication.php?selected-id=759 |
en |
pubs.place-of-publication |
Auckland |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |
pubs.subtype |
Technical Report |
en |
pubs.elements-id |
809818 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
pubs.number |
CDMTCS-545 |
en |
pubs.record-created-at-source-date |
2020-08-05 |
en |