PCP theorem and hardness of approximation
Statement
Dinur gave a combinatorial proof of the PCP theorem, central to hardness of approximation in CSPs.
Formula
gap amplification
Equation
NP ⊆ PCP[log, O(1)]
Source
Canonical lineament aligned with TANAAKK IAS Faculty Emeriti index (2026); consult specialist monographs for full proofs.
Domains
mathematics, computer-science