Intermediate
Theory of Computation
Q68 / 100
What is interactive proof system (IP class)?
Correct! Well done.
Incorrect.
The correct answer is B) A computational model where a polynomial-time verifier interacts with an unbounded prover via randomized challenges
B
Correct Answer
A computational model where a polynomial-time verifier interacts with an unbounded prover via randomized challenges
Explanation
IP = PSPACE (Shamir 1992). The prover convinces a verifier of a true statement through multiple rounds of interaction with randomized queries, with completeness and soundness properties.
Progress
68/100