A New Attempt for Satisfiability Problem: 3D DNA Self-Assembly to Solve SAT Problem.
Xuncai ZhangRuili FanYanfeng WangGuangzhao CuiPublished in: BIC-TA (2013)
Keyphrases
- satisfiability problem
- sat problem
- solving hard
- weighted max sat
- np complete
- search algorithm
- temporal logic
- phase transition
- sat instances
- max sat
- boolean satisfiability
- stochastic local search
- propositional satisfiability
- davis putnam
- randomly generated
- sat solvers
- constraint satisfaction problems
- random sat
- objective function
- stochastic local search algorithms
- mathematical programming
- retrieval effectiveness
- branch and bound
- information retrieval systems
- np hard
- special case