Computational complexity theory
Aanderaa–Karp–Rosenberg conjectureAdvice (complexity)Analysis of algorithmsApproximation-preserving reductionApproximation algorithmAsymptotic computational complexityAveraging argumentBest, worst and average caseBoolean circuitCertificate (complexity)Circuit complexityCircuits over sets of natural numbersCombinatorial searchCommunication complexityComplement (complexity)Complete (complexity)Complexity classCompression theoremComputable topologyComputation treeComputational complexity of mathematical operationsComputational resourceComputational topologyComputationally bounded adversaryComputing the permanentConfiguration graphConstructible functionContext of computational complexityDecision tree modelDescriptive complexity theoryDynamic problem (algorithms)Effective complexityElectronic Colloquium on Computational ComplexityExact algorithmExistential theory of the realsFolded Reed–Solomon code
subject
Analysis of algorithmsCircuit complexityComplexity classesComputational hardness assumptionsComputational problemsComputational resourcesDescriptive complexityNP-complete problemsParameterized complexityProbabilistic complexity theoryQuantum complexity theoryQuantum computingStrongly NP-complete problemsStructural complexity theoryTheorems in computational complexity theory
broader
Computational complexity theory
Wikipage page ID
Wikipage revision ID
720,931,020
type
label
Computational complexity theory
@en
sameAs
prefLabel
Computational complexity theory
@en