Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:citation |
Shamir, Adi. "IP = PSPACE." Journal of the ACM 39.4 (1992): 869-877.
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
IP = PSPACE theorem
|
| gptkbp:implies |
TQBF is in IP
|
| gptkbp:influenced |
gptkb:probabilistically_checkable_proofs
complexity class separations |
| gptkbp:provenBy |
gptkb:Adi_Shamir
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:interactive_proof_systems
gptkb:IP_complexity_class PSPACE complexity class |
| gptkbp:significance |
shows equivalence of interactive proofs and polynomial space
|
| gptkbp:state |
IP equals PSPACE
|
| gptkbp:yearProved |
1990
|
| gptkbp:bfsParent |
gptkb:IP_(complexity_class)
|
| gptkbp:bfsLayer |
6
|