Shu-Cheng Zhao

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper will survey the PCP theorem and its application in solving the MAX-SATISFY. For the problem MAX-SATISFY over F 2 , a random assignment satisfies half the equations and thus yields a 2-approximation algorithm. It is the best possible approximation algorithm in polynomial time based on P = N P , even if each equation only contains exactly three(More)
  • 1