Under the auspices of the Computational Complexity Foundation (CCF)
We prove that MAX-3SAT can be approximated in polynomial time within a factor 9/8 on random instances.
