MAX-3SAT is a language in the Computational Complexity subfield of Computer Science. It is a special case of the Boolean satisfiability problem (SAT) which is a decision problem considered in complexity theory. Informally it can be defined as:
Given a 3-CNF formula Φ (i.e. with at most 3 variables per clause), Find an assignment that satisfies the largest number of clauses.
An exact solution of MAX-3SAT is NP-hard. Therefore, a polynomial-time solution can only be achieved if P=NP. An approximation within a factor of 2 can be achieved with this simple algorithm, however:
The Karloff-Zwick algorithm runs in polynomial-time and satisfies ≥ 7/8 of the clauses.
The PCP Theorem implies that there exists an ε > 0 such that (1-ε)-approximation of MAX-3SAT is NP-hard.
Proof:
Any NP-complete problem L ∈ PCP(O(log (n)), O(1)) by the PCP Theorem. For x ∈ L, a 3-CNF formula Ψx is constructed so that
The Verifier V reads all required bits at once i.e. makes non-adaptive queries. This is valid because the number of queries remains constant.
Next we try to find a Boolean formula to simulate this. We introduce Boolean variables x1,...,xl, where l is the length of the proof. To demonstrate that the Verifier runs in Probabilistic polynomial-time, we need a correspondance between the number of satisfiable clauses and the probability the Verifier accepts.
It can be concluded that if this holds for every NP-complete problem then the PCP Theorem must be true.
MAX-3SAT(13) is a restricted version of MAX-3SAT where every variable occurs in at most 13 clauses.
Håstad demonstrates a tighter result than Theorem 1 i.e. the best known value for ε.
He constructs a PCP Verifier for 3-SAT that reads only 3 bits from the Proof.
For every ε > 0, there is a PCP-verifier M for 3-SAT that reads a random string r of length O(log(n)) and computes query positions ir, jr, kr in the proof π and a bit br. It accepts iff
π(ir) ⊕ π(jr) ⊕ π(kr) ⊕ = br.
The Verifier has completeness (1-ε) and soundness 1/2 + ε (refer to PCP (complexity)). The Verifier satisfies
If the first of these two equations were equated to "=1" as usual, one could find a proof π by solving a system of linear equations (see MAX-3LIN-EQN) implying P=NP.
This is enough to prove the hardness of approximation ratio
Luca Trevisan's Lecture Notes
University of California, Berkeley http://www.cs.berkeley.edu/~luca/notes/