Solving the 3-SAT Problem Based on DNA Computing.
Wenbin LiuLin GaoXiangrong LiuShudong WangJin XuPublished in: J. Chem. Inf. Comput. Sci. (2003)
Keyphrases
- dna computing
- sat problem
- implicit enumeration
- sat instances
- np complete problems
- weighted max sat
- random sat instances
- sat solving
- satisfiability problem
- dna sequences
- sat solvers
- stochastic local search
- constraint satisfaction problems
- phase transition
- np complete
- boolean satisfiability
- randomly generated
- max sat
- propositional satisfiability
- decision problems
- random sat
- davis putnam
- constraint satisfaction
- branch and bound