### 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 language | English (US) |
---|---|

Pages (from-to) | 154-162 |

Number of pages | 9 |

Journal | Proceedings of the Annual IEEE Conference on Computational Complexity |

State | Published - Nov 16 2005 |

Event | 20th Annual IEEE Conference on Computational Complexity - San Jose, CA, United States Duration: Jun 11 2005 → Jun 15 2005 |

### Fingerprint

### ASJC Scopus subject areas

- Software
- Theoretical Computer Science
- Computational Mathematics

### Cite this

*Proceedings of the Annual IEEE Conference on Computational Complexity*, 154-162.