PCP theorem (Q1140200)

From Wikidata
Jump to: navigation, search
theorem in complexity theory that every problem in NP has probabilistically checkable proofs
edit
Language Label Description Also known as
English
PCP theorem
theorem in complexity theory that every problem in NP has probabilistically checkable proofs

    Statements

    Identifiers

     
    edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit