Active Membranes, Proteins on Membranes, Tissue P Systems: Complexity-Related Issues and Challenges

Kód výsledku v IS VaVaI

RIV/47813059:19240/14:#0005320 - isvavai.cz

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Active Membranes, Proteins on Membranes, Tissue P Systems: Complexity-Related Issues and Challenges

Popis výsledku v původním jazyce

We resume computational complexity aspects of several models of membrane systems, namely P systems with active membranes, P systems with proteins on membranes and tissue P systems both with membrane separation and membrane division. A sequence of commonissues is studied in relation to these P system models, and 16 open problems are stated in the text. We question the role of families of P systems and their necessity to solve computationally hard problems in polynomial time. For each P system model we focus on conditions guaranteeing the polynomial equivalence of families of P systems and Turing machines. The ability of P systems to solve NP/co-NP-complete problems in polynomial time (trading space for time) is a very popular issue. Interesting characterizations of the borderline between tractability and intractability, i.e., P/NP, have been recently shown. Similarly important, although less popular, is the relation between NP/co-NP and further classes as PP, the polynomial hierarchy P

Název v anglickém jazyce

Active Membranes, Proteins on Membranes, Tissue P Systems: Complexity-Related Issues and Challenges

Popis výsledku anglicky

We resume computational complexity aspects of several models of membrane systems, namely P systems with active membranes, P systems with proteins on membranes and tissue P systems both with membrane separation and membrane division. A sequence of commonissues is studied in relation to these P system models, and 16 open problems are stated in the text. We question the role of families of P systems and their necessity to solve computationally hard problems in polynomial time. For each P system model we focus on conditions guaranteeing the polynomial equivalence of families of P systems and Turing machines. The ability of P systems to solve NP/co-NP-complete problems in polynomial time (trading space for time) is a very popular issue. Interesting characterizations of the borderline between tractability and intractability, i.e., P/NP, have been recently shown. Similarly important, although less popular, is the relation between NP/co-NP and further classes as PP, the polynomial hierarchy P

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

ED1.1.00/02.0070: Centrum excelence IT4Innovations

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

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

Název statě ve sborníku

Membrane Computing - 14th International Conference

ISBN

978-3-642-54238-1

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

15

Strana od-do

40-55

Název nakladatele

Springer

Místo vydání

Berlin

Místo konání akce

Moldavská republika

Datum konání akce

1. 1. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—