probabilistically checkable proof (Q841495)

From Wikidata
Jump to: navigation, search
type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof
  • PCP
edit
Language Label Description Also known as
English
probabilistically checkable proof
type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof
  • PCP

Statements

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit