Solving a PSPACE-complete problem with cP systems

Autor:	Michael J. Dinneen, Alec Henderson, Radu Nicolescu
Rok vydání:	2020
Předmět:	Discrete mathematics Computational Theory and Mathematics Hierarchy (mathematics) Applied Mathematics Theory of computation Nesting (computing) Limit (mathematics) Constant (mathematics) Travelling salesman problem PSPACE-complete Time complexity Mathematics
Zdroj:	Journal of Membrane Computing. 2:311-322
ISSN:	2523-8914 2523-8906
DOI:	10.1007/s41965-020-00064-w
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::a363daa1b812afef2bc77922c637d118 https://doi.org/10.1007/s41965-020-00064-w Zobrazit plný text záznamu Full text from SpringerLink