PCP theorem

theorem in complexity theory that every problem in NP has probabilistically checkable proofs

en-US/ˌpiˌsiˌpi ˈθɪɹəm/

Categories:

theorem