The Next Whisky Bar
We determine the complexity of an optimization problem related to information theory. Taking a conjunctive propositional formula over some finite set of Boolean relations as input, we seek a satisfying assignment of the formula having minimal Hamming distance to a given assignment that is not required to be a model (NearestSolution, NSol). We obtain a complete classification with respect to the relations admitted in the formula. For two classes of constraint languages we present polynomial time algorithms; otherwise, we prove hardness or completeness concerning the classes APX, poly-APX, NPO, or equivalence to well-known hard optimization problems.
KeywordsConstraint Satisfaction Problem Vertex Cover Conjunctive Normal Form Dual Relation Satisfying Assignment
- 6.Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part II: constraint satisfaction problems. SIGACT News, Complex. Theor. Column 43 35(1), 22–35 (2004)Google Scholar
- 11.Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Symposium on Theory of Computing (STOC 1978), San Diego, pp. 216–226 (1978)Google Scholar