Survey on k-satisfiable Partial Satisfaction

  • Hu Qinheping, Welzl
  • Published 2014


A CNF formula F is k-satisfiable if each k clauses of F can be satisfied simultaneously. Define rk to be the supremum of all real number r so that every weighted k-satisfiable CNF formula has an assignment that satisfies at least r-fraction of the weight. Define sk analogously for unweighted CNF formulas. We survey the results of the bound of rk and sk, i.e… (More)