A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Wealth of SAT Distributions with Planted Assignments
[chapter]
2003
Lecture Notes in Computer Science
While it is known how to generate satisfiable instances by reducing certain computational problems to SAT, it is not known how a similar generator can be developed directly for k-SAT. In this work we almost answer this question affirmatively by improving upon previous results in many ways. First, we give a generator for instances of MAX k-SAT, the version of k-SAT where one wants to maximize the number of satisfied clauses. Second, we provide a useful characterization of the optimal solution.
doi:10.1007/978-3-540-45193-8_19
fatcat:tddfuduc4beunphbffhu7oyqmy