2003
DOI: 10.1007/978-3-540-24635-0_26
|View full text |Cite
|
Sign up to set email alerts
|

The P Versus NP Problem Through Cellular Computing with Membranes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2005
2005
2010
2010

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 29 publications
(30 citation statements)
references
References 4 publications
0
30
0
Order By: Relevance
“…This class is closed under polynomial-time reduction and under complement (see [13] for a similar result for cell-like P systems). We also denote by PMC T D(k) the set of all decision problems which can be solved by means of recognizer tissue P systems with cell division in polynomial time, by using communication rules whose length is, at most, k.…”
Section: Polynomial Solvability By Recognizer Tissue P Systemsmentioning
confidence: 78%
“…This class is closed under polynomial-time reduction and under complement (see [13] for a similar result for cell-like P systems). We also denote by PMC T D(k) the set of all decision problems which can be solved by means of recognizer tissue P systems with cell division in polynomial time, by using communication rules whose length is, at most, k.…”
Section: Polynomial Solvability By Recognizer Tissue P Systemsmentioning
confidence: 78%
“…In the framework of AM(−n), efficient uniform solutions to weakly NPcomplete problems (Knapsack [27], Subset Sum [26], Partition [10]), and strongly NP-complete problems (SAT [32], Clique [4], Bin Packing [30], Common Algorithmic Problem [29]) have been obtained.…”
Section: Proposition 4 (Milano Theorem)mentioning
confidence: 99%
“…For a clearer description of the difference between uniform P systems and semi-uniform P systems, please refer to [7].…”
Section: P Systemsmentioning
confidence: 99%