ON A PARTIAL AFFIRMATIVE ANSWER FOR A PĂUN'S CONJECTURE
2011 ◽
Vol 22
(01)
◽
pp. 55-64
◽
Keyword(s):
At the beginning of 2005, Gheorghe Păun formulated a conjecture stating that in the framework of recognizer P systems with active membranes (evolution rules, communication rules, dissolution rules and division rules for elementary membranes), polarizations cannot be avoided in order to solve computationally hard problems efficiently (assuming that P ≠ NP ). At the middle of 2005, a partial positive answer was given, proving that the conjecture holds if dissolution rules are forbidden. In this paper we give a detailed and complete proof of this result modifying slightly the notion of dependency graph associated with recognizer P systems.
2014 ◽
pp. 194-206
Keyword(s):
2011 ◽
Vol 2
(3)
◽
pp. 35-48
◽
Keyword(s):
2019 ◽
Vol 2019
◽
pp. 1-8
◽
Keyword(s):
2008 ◽
Vol 3
(3)
◽
pp. 295
◽
Keyword(s):
2010 ◽
pp. 461-478
◽
Keyword(s):
1979 ◽
Vol 31
(5)
◽
pp. 1012-1016
◽
Keyword(s):