Name
Abstract | ||
|---|---|---|
In tissue P systems several cells (elementary membranes) communicate through symport/antiport rules, thus carrying out a computation. We add to such systems the basic feature of (cell-like) P systems with active membranes - the possibility to divide cells. As expected (as it is the case for P systems with active membranes), in this way we get the possibility to solve computationally hard problems in polynomial time; we illustrate this possibility with SAT problem. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.15837/ijccc.2008.3.2397 | INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL |
Keywords | Field | DocType |
tissue-like P systems, cell division rule, SAT problem, NP-complete problem | Cell division,Discrete mathematics,NP-complete,Computer science,Sat problem,Membrane,Time complexity,Membrane computing | Journal |
Volume | Issue | ISSN |
3 | 3 | 1841-9836 |
Citations | PageRank | References |
1 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gheorghe Paun | 1 | 2840 | 369.48 |
| Mario J. Pérez-Jiménez | 2 | 2207 | 180.19 |
| Agustín Riscos-Núñez | 3 | 1 | 0.34 |