Average-case analysis for the MAX-2SAT problem

Authors:
Osamu Watanabe;Masaki Yamamoto
Affiliations:
Dept. of Math. and Comput. Sci., Tokyo Inst. of Technology, Japan;Dept. of Math. and Comput. Sci., Tokyo Inst. of Technology, Japan
Venue:
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Year:
2006

Citing 2
Cited 2

Generating Instances for MAX2SAT with Optimal Solutions

Theory of Computing Systems
Hiding satisfying assignments: two are better than one

Journal of Artificial Intelligence Research

Finding Most Likely Solutions

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A spectral method for MAX2SAT in the planted solution model

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a “planted solution model” for discussing the average-case complexity of the MAX-2SAT problem. We show that for a large range of parameters, the planted solution (more precisely, one of the planted solution pair) is the optimal solution for the generated instance with high probability. We then give a simple linear time algorithm based on a message passing method, and we prove that it solves the MAX-2SAT problem with high probability under our planted solution model.