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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Achlioptas, D., Jia, H., Moore, C.: Hiding satisfying assignments: two are better than one. J. AI Research 24, 623–639 (2005)
Onsjö, M., Watanabge, O.: Simple algorithms for graph partition problems, Res. Report C-212, Dept. of Math. and Comput. Sci., Tokyo Tech (2005), http://www.is.titech.ac.jp/research/research-report/C/index.html
Scott, A.D., Sorkin, G.B.: Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 382–395. Springer, Heidelberg (2003)
Watanabe, O., Yamamoto, M.: Res. Report, Dept. of Math. and Comput. Sci., Tokyo Tech. (in preparation, 2006)
Yamamoto, M.: Generating instances for MAX2SAT with optimal solutions, Theory of Computing Systems (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Watanabe, O., Yamamoto, M. (2006). Average-Case Analysis for the MAX-2SAT Problem. In: Biere, A., Gomes, C.P. (eds) Theory and Applications of Satisfiability Testing - SAT 2006. SAT 2006. Lecture Notes in Computer Science, vol 4121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814948_27
Download citation
DOI: https://doi.org/10.1007/11814948_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37206-6
Online ISBN: 978-3-540-37207-3
eBook Packages: Computer ScienceComputer Science (R0)