Hardness of Max 3SAT with no mixed clauses

Venkatesan Guruswami, Subhash Khot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study the complexity of approximating Max NM-E3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its literals unnegated or all of them negated. This is a natural special case of Max 3SAT introduced in [7], where the question of whether this variant can be approximated within a factor better than 7/8 was also posed. We prove that it is NP-hard to approximate Max NM-E3SAT within a factor of 7/8 + ∈ for arbitrary ∈ > 0, and thus this variant is no easier to approximate than general Max 3SAT. The proof uses the technique of multilayered PCPs, introduced in [3], to avoid the technical requirement of folding of the proof tables. Circumventing this requirement means that the PCP verifier can use the bits it accesses without additional negations, and this leads to a hardness for Max 3SAT without any mixed clauses.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual IEEE Conference on Computational Complexity
Pages154-162
Number of pages9
StatePublished - 2005
Event20th Annual IEEE Conference on Computational Complexity - San Jose, CA, United States
Duration: Jun 11 2005Jun 15 2005

Other

Other20th Annual IEEE Conference on Computational Complexity
CountryUnited States
CitySan Jose, CA
Period6/11/056/15/05

Fingerprint

Hardness
Requirements
Folding
Tables
NP-complete problem
Arbitrary

ASJC Scopus subject areas

  • Computational Mathematics

Cite this

Guruswami, V., & Khot, S. (2005). Hardness of Max 3SAT with no mixed clauses. In Proceedings of the Annual IEEE Conference on Computational Complexity (pp. 154-162)

Hardness of Max 3SAT with no mixed clauses. / Guruswami, Venkatesan; Khot, Subhash.

Proceedings of the Annual IEEE Conference on Computational Complexity. 2005. p. 154-162.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Guruswami, V & Khot, S 2005, Hardness of Max 3SAT with no mixed clauses. in Proceedings of the Annual IEEE Conference on Computational Complexity. pp. 154-162, 20th Annual IEEE Conference on Computational Complexity, San Jose, CA, United States, 6/11/05.
Guruswami V, Khot S. Hardness of Max 3SAT with no mixed clauses. In Proceedings of the Annual IEEE Conference on Computational Complexity. 2005. p. 154-162
Guruswami, Venkatesan ; Khot, Subhash. / Hardness of Max 3SAT with no mixed clauses. Proceedings of the Annual IEEE Conference on Computational Complexity. 2005. pp. 154-162
@inproceedings{167de6d52b24480b8a02e74e7da73e6f,
title = "Hardness of Max 3SAT with no mixed clauses",
abstract = "We study the complexity of approximating Max NM-E3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its literals unnegated or all of them negated. This is a natural special case of Max 3SAT introduced in [7], where the question of whether this variant can be approximated within a factor better than 7/8 was also posed. We prove that it is NP-hard to approximate Max NM-E3SAT within a factor of 7/8 + ∈ for arbitrary ∈ > 0, and thus this variant is no easier to approximate than general Max 3SAT. The proof uses the technique of multilayered PCPs, introduced in [3], to avoid the technical requirement of folding of the proof tables. Circumventing this requirement means that the PCP verifier can use the bits it accesses without additional negations, and this leads to a hardness for Max 3SAT without any mixed clauses.",
author = "Venkatesan Guruswami and Subhash Khot",
year = "2005",
language = "English (US)",
pages = "154--162",
booktitle = "Proceedings of the Annual IEEE Conference on Computational Complexity",

}

TY - GEN

T1 - Hardness of Max 3SAT with no mixed clauses

AU - Guruswami, Venkatesan

AU - Khot, Subhash

PY - 2005

Y1 - 2005

N2 - We study the complexity of approximating Max NM-E3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its literals unnegated or all of them negated. This is a natural special case of Max 3SAT introduced in [7], where the question of whether this variant can be approximated within a factor better than 7/8 was also posed. We prove that it is NP-hard to approximate Max NM-E3SAT within a factor of 7/8 + ∈ for arbitrary ∈ > 0, and thus this variant is no easier to approximate than general Max 3SAT. The proof uses the technique of multilayered PCPs, introduced in [3], to avoid the technical requirement of folding of the proof tables. Circumventing this requirement means that the PCP verifier can use the bits it accesses without additional negations, and this leads to a hardness for Max 3SAT without any mixed clauses.

AB - We study the complexity of approximating Max NM-E3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its literals unnegated or all of them negated. This is a natural special case of Max 3SAT introduced in [7], where the question of whether this variant can be approximated within a factor better than 7/8 was also posed. We prove that it is NP-hard to approximate Max NM-E3SAT within a factor of 7/8 + ∈ for arbitrary ∈ > 0, and thus this variant is no easier to approximate than general Max 3SAT. The proof uses the technique of multilayered PCPs, introduced in [3], to avoid the technical requirement of folding of the proof tables. Circumventing this requirement means that the PCP verifier can use the bits it accesses without additional negations, and this leads to a hardness for Max 3SAT without any mixed clauses.

UR - http://www.scopus.com/inward/record.url?scp=27644547714&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27644547714&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:27644547714

SP - 154

EP - 162

BT - Proceedings of the Annual IEEE Conference on Computational Complexity

ER -