Average-case analysis for the MAX-2SAT problem

DOI10.1016/J.TCS.2009.12.020zbMath1191.68058OpenAlexW2004757069MaRDI QIDQ964385

Osamu Watanabe, Masaki Yamamoto

Publication date: 15 April 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.12.020

zbMATH Keywords

average case analysisbelief propagationplanted solution modelMAX-2SAT

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

Message passing algorithms for MLS-3LIN problem

Cites Work

• Generating instances for MAX2SAT with optimal solutions
• Some optimal inapproximability results
• Experimental and Efficient Algorithms
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Average-case analysis for the MAX-2SAT problem