1.0957-Approximation Algorithm for Random MAX-3SAT
We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957 on random instances.
We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957 on random instances.
Page 1