Computability and complexity. Foundations and tools for pursuing scientific applications
computational complexitylower boundsapproximation algorithmsNP-completenessfinite automataMinsky machinesPSPACE-completenesskernelizationregular languagesset theoryTuring machinesrecursion theoremaverage-case complexityTuring reducibilityLadner's theoremgeneric-case complexitypartial recursive functionsparametrised complexityuncountable setscountable setsoraclesarithmetic hierarchyundecidable problemsunsolvable word problemsGödel numbersSavitch's theoremdeeper computabilityparametric intractabilityparametrised tractabilitywait-and-see arguments
This page was built for publication: Computability and complexity. Foundations and tools for pursuing scientific applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549533)