2015
DOI: 10.3233/fi-2015-1197
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: A membrane system (P system) is a distributed computing model inspired by information processes in living cells. P systems previously provided new characterizations of a variety of complexity classes and their borderlines. Specifically, in tissue-like membrane systems, cell separation rules have been considered joint with communication rules of the form symport/antiport. On the one hand, only tractable problems can be efficiently solved by using cell separation and communication rules with length at most 2. On… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 36 publications
(22 citation statements)
references
References 17 publications
0
22
0
Order By: Relevance
“…Unlike the case of cell division, here the length k = 2 of communication rules does not increase the efficiency of uniform families of tissue P systems beyond P [45]:…”
Section: S E P a R A T I O N R U L E S : [A]mentioning
confidence: 90%
“…Unlike the case of cell division, here the length k = 2 of communication rules does not increase the efficiency of uniform families of tissue P systems beyond P [45]:…”
Section: S E P a R A T I O N R U L E S : [A]mentioning
confidence: 90%
“…SAT problem has been widely investigated by cell-like P systems [4][5][6][7][8]. However, it is rarely investigated by tissue P systems.…”
Section: Mathematical Problems In Engineeringmentioning
confidence: 99%
“…Therefore, NP-hard problems can be solved efficiently. Until now, many kinds of P systems can solve some NP-complete problems, such as SAT [4][5][6][7][8][9][10], 3coloring problem [11], and Hamiltonian cycle problem [12]. In addition, many new variants of P systems have equivalent computing power with Turing machine and to be Turing universal as language generators [13][14][15].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, it clearly suffices to find a subset E ⊆ D with P E = P D and prove P E closed under reasonable operations to obtain the same result for P D . This is the case for D = NP ∪ coNP (and E = NP), a class that frequently appears in the membrane computing literature [8,21,23,31,30] and is not known to be itself directed. In fact this would imply NP = coNP, since there would be a language L ∈ NP∪coNP such that L 1 ≤ L for an NP-complete language L 1 and L 2 ≤ L for a coNP-complete language L 2 .…”
Section: Introductionmentioning
confidence: 99%