As Close as It Gets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

As Close as It Gets

Résumé

We study the minimum Hamming distance between distinct satisfying assignments of a conjunctive input formula over a given set of Boolean relations (???????????????????, ???). We present a complete classification of the complexity of this optimization problem 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 with respect to poly-APX, or NPO, or equivalence to a well-known hard optimization problem.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-03300998 , version 1

Citer

Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer. As Close as It Gets. 10th International Workshop on Algorithms and Computation (WALCOM '16), 2016, Kathmandu, Nepal. pp.222--235. ⟨hal-03300998⟩
10 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More