PSPACE Limits the Power of P Systems with Active Membranes

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F14%3A%230005318" target="_blank" >RIV/47813059:19240/14:#0005318 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
PSPACE Limits the Power of P Systems with Active Membranes
Original language description
P system with active membranes is probably the most intensively studied model of membrane systems. It was previously shown that many variants of these P systems can solve NP-hard problems in polynomial time, using the strategy of trading space for time.The reverse problem of finding the upper bound of their power was studied, too, and a result showing the upper bound by the complexity class PSPACE was published. In this publication, however, an altered definition of families of P systems was used. An analogous result has not been shown yet for polynomially uniform families of P systems with active membranes under their standard definition, and it was questioned whether such a result holds or not. Here we resolve this open problem positively and we show that the mentioned families of P systems with active membranes can solve, in polynomial time, at most the class of problems PSPACE. Together with other previously known results we can conclude that these families are a member of the Sec
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)