Solving All‐SAT Problems by P Systems

Guo, Ping; Ji, Jinfang; Chen, Haizhu; Liu, Ran

doi:10.1049/cje.2015.10.013

Cited by 12 publications

(15 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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

Time‐Free Solution to SAT Problem by Tissue P Systems

Luo

Xiong

Zhang

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Tissue P systems are a class of computing models inspired by intercellular communication, where the rules are used in the nondeterministic maximally parallel manner. As we know, the execution time of each rule is the same in the system. However, the execution time of biochemical reactions is hard to control from a biochemical point of view. In this work, we construct a uniform and efficient solution to the SAT problem with tissue P systems in a time-free way for the first time. With the P systems constructed from the sizes of instances, the execution time of the rules has no influence on the computation results. As a result, we prove that such system is shown to be highly effective for NP-complete problem even in a time-free manner with communication rules of length at most 3.

show abstract

“…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%

Section: Introductionmentioning

confidence: 99%

Time‐Free Solution to SAT Problem by Tissue P Systems

Luo

Xiong

Zhang

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Researchers have designed several P systems to solve NPhard problems, such as SAT [7], [8], HPP [9], [10], TSP [11]- [15] and so on. The TSP (namely, travelling salesman problem) is a typical representative of the NP hard problem.…”

Section: Introductionmentioning

confidence: 99%

A P System for Solving All-Solutions of TSP

Guo¹,

Xiang²,

Xie³

et al. 2017

ijacsa

Self Cite

View full text Add to dashboard Cite

Abstract-P system is a parallel computing system based on a membrane computing model. Since the calculation process of the P system has the characteristics of maximum parallelism and Non-determinism, it has been used to solve the NP-hard problem in polynomial time. This paper designs a P system for TSP problem solving. This P system can not only determine whether the TSP problem has solution, but also give the allsolution when the TSP problem is solved. Finally, an example is given to illustrate the feasibility and effectiveness of the P system designed in this paper.

show abstract

“…Until now, many kinds of P system have been proposed to solve NP-complete problems, such as SAT [9][10][11][12][13], HPP [14][15], Subset [16], Knapsack Problem [17], optimization problem [18][19][20]. There are two main ways for P systems solving NP-complete problem: the semi-uniform way, which associates with each instance of the problem one P system solving it, and the uniform way, which associates with each possible size of the instances of the problem one P system that can solve all instances of that size [21].…”

Section: Introductionmentioning

confidence: 99%