Name
Abstract | ||
|---|---|---|
We study tissue-like P systems which use string objects and communicate by introducing communication symbols in the strings. We prove that these systems are computationally complete and moreover, they are computationally efficient in the sense that NP-complete problems can be solved in this framework in polynomial time. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1142/S0129054108005917 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
p system | Computer science,Theoretical computer science,Time complexity | Journal |
Volume | Issue | ISSN |
19 | 3 | 0129-0541 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erzsébet Csuhaj-Varjú | 1 | 593 | 87.27 |
| Gheorghe Paun | 2 | 2840 | 369.48 |
| György Vaszil | 3 | 277 | 40.65 |