Q1140200

From Wikidata
Jump to: navigation, search

PCP theorem (Q1140200) [edit]

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

No aliases defined.
    [edit]

    Statements

    0 references
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]