PCP theorem

The PCP (Probabilistically Checkable Proofs) theorem is a significant result in computational complexity theory that characterizes the class of decision problems that can be efficiently verified by a probabilistic verifier using a limited amount of randomness and reading only a small portion of the proof.