|
Descripción
|
|
|---|---|
| Tissue P systems generalize the membrane structure tree usual in original models of P systems to an arbitrary graph. Basic opera- tions in these systems are communication rules, enriched in some variants with cell division or cell separation. Several variants of tissue P systems were recently studied, together with the concept of uniform families of these systems. Their computational power was shown to range between P and NP ? co-NP , thus characterizing some interesting borderlines between tractability and intractability. In this paper we show that com- putational power of these uniform families in polynomial time is limited by the class PSPACE . This class characterizes the power of many clas- sical parallel computing models | |
|
Internacional
|
Si |
|
Nombre congreso
|
13th International Conference, CMC 2012 |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
|
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-3-642-36750-2 |
|
DOI
|
|
|
Fecha inicio congreso
|
28/08/2013 |
|
Fecha fin congreso
|
31/05/2013 |
|
Desde la página
|
390 |
|
Hasta la página
|
403 |
|
Título de las actas
|
Membrane Computing |