In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. It is equal to the class PSPACE. The concept was first introduced by Shafi Goldwasser, Silvio Micali, and Charles Rackoff in 1985.
In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. It is equal to the class PSPACE. The concept was first introduced by Shafi Goldwasser, Silvio Micali, and Charles Rackoff in 1985.