科研之友
微信
新浪微博
Facebook
分享链接
摘要
P system is a new kind of distributed parallel computing model, and its many variants are used to solve NP problems. All-SAT problem is a well-known NP hard problem and it has been widely applied in the fields of project selection problem, capital budgeting problem and so on. In this paper, we present a family of P systems to solve All-SAT problem in a linear time based on membrane division and give an instance to illustrate the feasibility and effectiveness of our designed P systems.
- 出版日期2018-3
- 单位重庆大学
