Balanced Max 2-Sat might not be the hardest.
Per AustrinPublished in: Electron. Colloquium Comput. Complex. (2006)
Keyphrases
- max sat
- weighted max sat
- lower bound
- branch and bound algorithm
- sat solvers
- tabu search
- search algorithm
- branch and bound
- satisfiability problem
- stochastic local search
- maximum satisfiability
- upper bound
- linear programming
- sat problem
- max sat solver
- unsatisfiable cores
- variable ordering
- information retrieval
- np hard
- optimal solution
- genetic algorithm