Probabilistically checkable proofs and their impact on computational
complexity, including hardness of approximation results (certain
combinatorial problems, for which one can show that deterministically
finding a solution, even a suboptimal one, is computationally intractable.)