N P = P C P [ O ( log n ) , O ( 1 ) ]
PCP theorem
PCP-Theorem
theorem in complexity theory that every problem in NP has probabilistically checkable proofs
mathematischer Satz