On the upper bounds of (1,0)-super solutions for the regular balanced random (k,2s)-SAT problem.
Yongping WangDaoyun XuJincheng ZhouPublished in: Frontiers Comput. Sci. (2024)
Keyphrases
- upper bound
- sat problem
- random sat instances
- randomly generated
- lower bound
- satisfiability problem
- max sat
- np complete
- phase transition
- upper and lower bounds
- branch and bound
- lower and upper bounds
- sat instances
- sat solvers
- random sat
- boolean satisfiability
- branch and bound algorithm
- optimal solution
- sufficient conditions
- stochastic local search
- probability distribution
- sat solving
- objective function
- constraint satisfaction problems
- random instances
- special case