Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:communicationRounds |
gptkb:algebra
|
| gptkbp:complexityClassType |
probabilistic
|
| gptkbp:contains |
gptkb:BPP
gptkb:PSPACE NP |
| gptkbp:describes |
decision problems solvable by an interactive proof system in polynomial time
|
| gptkbp:equivalentTo |
gptkb:PSPACE
|
| gptkbp:fullName |
gptkb:Interactive_Polynomial_time
|
| https://www.w3.org/2000/01/rdf-schema#label |
IP (complexity class)
|
| gptkbp:introduced |
gptkb:Adi_Shamir
|
| gptkbp:introducedIn |
1990
|
| gptkbp:notableAchievement |
gptkb:IP_=_PSPACE_theorem
|
| gptkbp:proverType |
computationally unbounded
|
| gptkbp:relatedTo |
gptkb:Arthur-Merlin_protocol
zero-knowledge proof interactive proof system |
| gptkbp:significance |
proved that IP = PSPACE
|
| gptkbp:usedIn |
gptkb:complexity_theory
cryptography |
| gptkbp:verifierType |
probabilistic polynomial time
|
| gptkbp:bfsParent |
gptkb:interactive_proof_systems
|
| gptkbp:bfsLayer |
5
|