e/IP (complexity)

Information
has gloss	eng: In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. The concept of an interactive proof system was first introduced by Shafi Goldwasser, Silvio Micali, and Charles Rackoff in 1985. An interactive proof system consists of two machines, a prover, P, which presents a proof that a given string n is a member of some language, and a verifier, V, that checks that the presented proof is correct. The prover is assumed to be infinite in computation and storage, while the verifier is a probabilistic polynomial-time machine with access to a random bit string whose length is polynomial on the size of n. These two machines exchange a polynomial number, p(n), of messages and once the interaction is completed, the verifier must decide whether or not n is in the language, with only a 1/3 chance of error.
lexicalization	eng: IP
instance of	c/Probabilistic complexity classes

Meaning
Hebrew
lexicalization	heb: IP
Korean
has gloss	kor: 계산 복잡도 이론에서 IP는 대화형 증명 체계로 풀 수 있는 문제의 집합이다. 이 시스템의 개념은 골트바서 들이 1985년에 처음 소개하였다. 대화형 증명 체계는 문자열 n이 어떤 언어에 들어가는 것을 증명하는 증명자 P와, 증명이 올바른지를 검증하는 검증자 V로 이루어져 있다.
lexicalization	kor: IP
Chinese
has gloss	zho: 在計算複雜性理論內, IP是由交互式證明系統所能解決的一類問題。交互式證明系統的概念最早是由Shafi Goldwasser，Silvio Micali，和Charles Rackoff在1985年提出的。一個交互式證明系統包含兩個部份(或說兩台machine)，一個證明者(prover)，P，它展示出一個特定長度的輸入字串n是否在某語言之內的證明，和一個驗證者(verifier)，V，檢查這個證明是否正確。這裡假設證明者有無限的計算能力跟容量，而驗證者是一個概率多項式時間的機器，with access to a random bit string whose length is polynomial on the size of n. These two machines exchange a 多項式個數, p(n)，的資訊，而且在交換資訊之後，驗證者必須在1/3的錯誤率以內決定n是否在這個語言之內。 (所以在BPP內的語言一定在IP之內，因為我們可以讓驗證者直接忽略證明者然後自己對這問題作決定。) 更正式的說:
lexicalization	zho: IP