Approximation-Algorithms

• The PCP Theorem: Why Some Problems Are Hard Even to Approximate · 2025-03-30

  Unpack one of theoretical computer science's crown jewels: the PCP theorem, which shows that for many NP-hard problems, even finding an approximate solution is intractable — and how probabilistically checkable proofs revolutionized our understanding of hardness.