On the Lower Bounds of (1, 0)-Super Solutions for Random k-SAT.
Guangyan ZhouRui KangPublished in: Int. J. Found. Comput. Sci. (2019)
Keyphrases
- lower bound
- optimal solution
- upper bound
- random instances
- running times
- max sat
- search algorithm
- search methods
- objective function
- stochastic local search algorithms
- exact solution
- sat solvers
- branch and bound
- satisfiability problem
- branch and bound algorithm
- propositional logic
- feasible solution
- quadratic assignment problem
- np hard
- boolean satisfiability
- data structure
- genetic algorithm