e/Probabilistically checkable proof

Information
has gloss	eng: In computational complexity theory, a probabilistically checkable proof (PCP) is a 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. The algorithm is then required to accept correct proofs and reject incorrect proofs with very high probability. A standard proof (or certificate), as used in the verifier-based definition of the complexity class NP, also satisfies these requirements, since the checking procedure deterministically reads the whole proof, always accepts correct proofs and rejects incorrect proofs. However, what makes them interesting is the existence of probabilistically checkable proofs that can be checked by reading only a few bits of the proof using randomness in an essential way.
lexicalization	eng: probabilistically checkable proof
lexicalization	eng: Probabilistically-checkable proof
instance of	(noun) a formal series of statements showing that if one thing is true something else necessarily follows from it proof

Meaning
Japanese
has gloss	jpn: 計算複雑性理論における PCP とは、確率的検査可能証明（probabilistically checkable proof）系を持つ決定問題の複雑性クラスである。
lexicalization	jpn: PCP
Korean
has gloss	kor: 계산 복잡도 이론에서 PCP는 확률적으로 검사할 수 있는 증명을 할 수 있는 판정 문제들의 복잡도 종류이다.
lexicalization	kor: PCP