膜计算
计算机科学
班级(哲学)
高效算法
钥匙(锁)
时间复杂性
理论计算机科学
多项式的
数学优化
人工智能
算法
数学
计算机安全
数学分析
作者
David Orellana-Martín,Luis Valencia-Cabrera,Bosheng Song,Linqiang Pan,Mario J. Pérez–Jiménez
出处
期刊:Complexity
[Hindawi Limited]
日期:2021-04-28
卷期号:2021: 1-14
被引量:5
摘要
Over the last few years, a new methodology to address the P versus NP problem has been developed, based on searching for borderlines between the nonefficiency of computing models (only problems in class P can be solved in polynomial time) and the presumed efficiency (ability to solve NP-complete problems in polynomial time). These borderlines can be seen as frontiers of efficiency, which are crucial in this methodology. “Translating,” in some sense, an efficient solution in a presumably efficient model to an efficient solution in a nonefficient model would give an affirmative answer to problem P versus NP. In the framework of Membrane Computing, the key of this approach is to detect the syntactic or semantic ingredients that are needed to pass from a nonefficient class of membrane systems to a presumably efficient one. This paper deals with tissue P systems with communication rules of type symport/antiport allowing the evolution of the objects triggering the rules. In previous works, frontiers of efficiency were found in these kinds of membrane systems both with division rules and with separation rules. However, since they were not optimal, it is interesting to refine these frontiers. In this work, optimal frontiers of the efficiency are obtained in terms of the total number of objects involved in the communication rules used for that kind of membrane systems. These optimizations could be easier to translate, if possible, to efficient solutions in a nonefficient model.
科研通智能强力驱动
Strongly Powered by AbleSci AI