|
gptkbp:instanceOf
|
gptkb:academic
|
|
gptkbp:analyzes
|
resource usage
|
|
gptkbp:concerns
|
classification of computational problems
|
|
gptkbp:defines
|
complexity classes
|
|
gptkbp:fieldOfStudy
|
gptkb:mathematics
theoretical computer science
|
|
gptkbp:hasResource
|
gptkb:time_zone
space
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Complexity theory
|
|
gptkbp:notableConference
|
gptkb:Computational_Complexity_Conference
|
|
gptkbp:notableFor
|
gptkb:BPP
gptkb:PSPACE
gptkb:EXP
P
L
NL
NP
|
|
gptkbp:notablePerson
|
gptkb:Avi_Wigderson
gptkb:Manuel_Blum
gptkb:Michael_Sipser
gptkb:Oded_Goldreich
gptkb:Richard_Karp
gptkb:Shafi_Goldwasser
gptkb:Stephen_Cook
gptkb:Alan_Cobham
gptkb:Leonid_Levin
gptkb:Richard_Lipton
gptkb:László_Babai
gptkb:Leslie_Valiant
gptkb:Jurisd_Hartmanis
|
|
gptkbp:notablePublication
|
gptkb:SIAM_Journal_on_Computing
gptkb:Journal_of_Computer_and_System_Sciences
Theoretical Computer Science
|
|
gptkbp:numberOfIssues
|
gptkb:P_vs_NP
gptkb:Unique_Games_Conjecture
gptkb:P_vs_NP_problem
gptkb:P_vs_PSPACE
gptkb:Exponential_Time_Hypothesis
Circuit Lower Bounds
L vs NL
NP vs co-NP
|
|
gptkbp:relatedTo
|
gptkb:information_theory
algorithm analysis
circuit complexity
computability theory
cryptography
parameterized complexity
proof complexity
randomized algorithms
approximation algorithms
descriptive complexity
|
|
gptkbp:studies
|
computational complexity
|
|
gptkbp:bfsParent
|
gptkb:Karp_reduction
|
|
gptkbp:bfsLayer
|
5
|