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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01377704
Contributor : Dimitri Watel <>
Submitted on : Friday, October 7, 2016 - 2:27:27 PM
Last modification on : Friday, January 24, 2020 - 12:04:03 PM
Long-term archiving on: Friday, February 3, 2017 - 6:46:00 PM

File

IPL-2016.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

  • HAL Id : hal-01377704, version 1

Citation

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

Share

Metrics

Record views

730

Files downloads

106