The Next Whisky Bar - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

The Next Whisky Bar

(1) , (2) , (3) , (4)
1
2
3
4

Abstract

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.
Not file

Dates and versions

hal-03301002 , version 1 (27-07-2021)

Identifiers

  • HAL Id : hal-03301002 , version 1

Cite

Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer. The Next Whisky Bar. 11th International Computer Science Symposium in Russia (CSR'16), 2016, St. Petersburg, Russia. pp.41--56. ⟨hal-03301002⟩
8 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More