Should Algorithms for Random SAT and Max-SAT Be Different?
Sixue LiuGerard de MeloPublished in: AAAI (2017)
Keyphrases
- max sat
- random sat instances
- sat problem
- combinatorial optimization
- sat solvers
- boolean satisfiability
- learning algorithm
- satisfiability problem
- orders of magnitude
- phase transition
- branch and bound algorithm
- branch and bound
- sat instances
- stochastic local search
- propositional satisfiability
- maximum satisfiability
- lower bound