Statements (55)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic
|
| gptkbp:application |
gptkb:artificial_intelligence
cryptography operations research theoretical computer science optimization |
| gptkbp:fieldOfStudy |
gptkb:mathematics
computer science |
| gptkbp:hasConcept |
gptkb:NP-completeness
gptkb:P_vs_NP_problem completeness theoretical computer science hardness reducibility |
| gptkbp:hasSubfield |
gptkb:interactive_proof_systems
circuit complexity advice complexity circuit lower bounds communication complexity descriptive complexity theory fine-grained complexity parameterized complexity proof complexity quantum complexity randomized complexity resource-bounded computation structural complexity theory |
| https://www.w3.org/2000/01/rdf-schema#label |
complexity theory
|
| gptkbp:notableContributor |
gptkb:Michael_Sipser
gptkb:Richard_Karp gptkb:Stephen_Cook gptkb:Alan_Cobham gptkb:Leonid_Levin |
| gptkbp:notableFor |
gptkb:BPP
gptkb:EXPTIME gptkb:PSPACE gptkb:co-NP P L NL NP PH #P |
| gptkbp:numberOfIssues |
gptkb:P_vs_NP_problem
gptkb:Polynomial_hierarchy EXPTIME vs NEXPTIME NP-complete problems Space complexity |
| gptkbp:relatedTo |
computability theory
algorithm theory |
| gptkbp:studies |
computational complexity
classification of computational problems resource requirements of algorithms |
| gptkbp:bfsParent |
gptkb:Shafi_Goldwasser
|
| gptkbp:bfsLayer |
3
|