Interactive proof systems were formulated in 1985 as published in the seminal research paper titled "The Knowledge Complexity of Interactive Proof Systems".
In computational complexity theory, an interactive proof system is an abstract machine that models computation as the interaction between two parties by exchanging messages.
IP is the main complexity class that describing interactive proof system.
It has been proven that IP equals PSPACE which means that IP is the class of problems solvable by a deterministic Turing machine in polynomial space.
No comments:
Post a Comment