The paper links PCPs to approximation. If you can approximate the size of the "Maximum Clique" in a graph within a certain factor, you could use that approximation algorithm to verify proofs. Since verifying proofs is NP-complete, the approximation algorithm must also be NP-hard.
To understand this PDF, you must grasp three core concepts: cs.00056 pdf
Tackle Exercises/Quizzes
Challenge Yourself