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
Press Enter · cited answer in seconds
0 sources
interactive proof system
Summary
interactive proof system ranks in the top 2% of general entities by monthly Wikipedia readership (92 views/month).[1]
Key Facts
- interactive proof system's Freebase ID is recorded as /m/0155cl[2].
- interactive proof system's Dictionary of Algorithms and Data Structures ID is recorded as interactvprf[3].
- interactive proof system's schematic is recorded as Interactive proof (complexity).svg[4].
- interactive proof system's Microsoft Academic ID is recorded as 201768162[5].
Body
Works and Contributions
Things named for interactive proof system include IP[6], a complexity class[7].
Why It Matters
interactive proof system ranks in the top 2% of general entities by monthly Wikipedia readership (92 views/month).[1] It has Wikipedia articles in 10 language editions, a strong signal of global cultural recognition.[8] It is known by 3 alternative names across languages and contexts.[9]