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
- lower bound
- randomly generated
- satisfiability problem
- max sat
- sat solvers
- branch and bound algorithm
- random sat instances
- phase transition
- branch and bound
- constraint satisfaction problems
- boolean satisfiability
- random instances
- optimal solution
- lower and upper bounds
- upper and lower bounds
- np complete
- stochastic local search
- weighted max sat
- combinatorial problems
- random sat
- sat instances
- uniform distribution
- propositional satisfiability
- simulated annealing
- evolutionary algorithm
- data structure