Q1140200

From Wikidata
Jump to: navigation, search

PCP theorem(Q1140200)

theorem in complexity theory that every problem in NP has probabilistically checkable proofs
    No aliases defined.
[edit]
Language Label Description Also known as
English
PCP theorem
theorem in complexity theory that every problem in NP has probabilistically checkable proofs

    Statements

    /m/08jszr
    1 reference
    0 references
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]