Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:abbreviation |
gptkb:IP
|
| gptkbp:characterizedBy |
problems solvable by an interactive proof system in polynomial time
|
| gptkbp:contains |
gptkb:BPP
NP |
| gptkbp:definedIn |
theoretical computer science
|
| gptkbp:equivalentTo |
gptkb:PSPACE
|
| https://www.w3.org/2000/01/rdf-schema#label |
Interactive Polynomial time
|
| gptkbp:introduced |
gptkb:Shafi_Goldwasser
gptkb:Silvio_Micali gptkb:Charles_Rackoff |
| gptkbp:introducedIn |
1985
|
| gptkbp:provenBy |
gptkb:Lewis
gptkb:Babai gptkb:Nisan gptkb:Lund gptkb:Adleman gptkb:Shamir gptkb:Manders Fortnow |
| gptkbp:relatedTo |
gptkb:complexity_theory
gptkb:BPP gptkb:PSPACE gptkb:Arthur-Merlin_protocol NP interactive proof system |
| gptkbp:bfsParent |
gptkb:IP_(complexity_class)
|
| gptkbp:bfsLayer |
6
|