A note on the inapproximability of the Minimum Monotone Satisfying Assignment problem - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2016

A note on the inapproximability of the Minimum Monotone Satisfying Assignment problem

Abstract

The Minimum Monotone Satisfying Assignment problem (MMSA) consists, given a monotone boolean formula ϕ, in searching for a minimum number of true variables such that ϕ is satisfied. A polynomial inapproximability ratio was given by Dinur et al. However, this ratio depends on a parameter that is not the size of the MMSA instance. It is instead the size of the problem from which the reduction is done. Consequently, it is hard to reuse this result to prove other hardness of approximability. In this paper, we deepen the previous work and prove two inapproximability ratio for MMSA depending on the size of the formula and the number of variables and we prove that MMSA cannot be polylogarithmically approximated.
Fichier principal
Vignette du fichier
IPL-2016.pdf (273.75 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01377704 , version 1 (07-10-2016)

Licence

Identifiers

  • HAL Id : hal-01377704 , version 1

Cite

Dimitri Watel, Marc-Antoine Weisser. A note on the inapproximability of the Minimum Monotone Satisfying Assignment problem. 2016. ⟨hal-01377704⟩
451 View
132 Download

Share

Gmail Mastodon Facebook X LinkedIn More