Abstract
We investigate the complexity of an optimization problem in Boolean propositional logic related to information theory: Given a conjunctive formula over a set of relations, find a satisfying assignment with minimal Hamming distance to a given assignment that satisfies the formula (NearestOtherSolution, NOSol). We present a complete classification with respect to the relations admitted in the formula. We give polynomial-time algorithms for several classes of constraint languages. For all other cases we prove hardness or completeness regarding poly-APX, NPO, or equivalence to a well-known hard optimization problem.
Cite
CITATION STYLE
Behrisch, M., Hermann, M., Mengel, S., & Salzer, G. (2015). Give me another one! In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9472, pp. 664–676). Springer Verlag. https://doi.org/10.1007/978-3-662-48971-0_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
