interactive proof system ^{الإنجليزية} (Q2979381)

in computational complexity theory, an abstract machine modeling computation as two parties (an untrusted but powerful ‘prover’; a trusted ‘verifier’ with bounded resources) exchanging messages to ascertain whether some string belongs to a language ^{الإنجليزية}

اللغة	التسمية	الوصف	أسماء أخرى
العربية	لم تُضف التسمية	لا يوجد وصف
الإنجليزية	interactive proof system	in computational complexity theory, an abstract machine modeling computation as two parties (an untrusted but powerful ‘prover’; a trusted ‘verifier’ with bounded resources) exchanging messages to ascertain whether some string belongs to a language