scientific article; zbMATH DE number 1542049

MaRDI QIDQ4520107zbMATH OpenFDO

Authors Gerd Wechsung

Publication date 11 December 2000

zbMATH Keywords

Boolean hierarchycompletenesscomplexity classescomplexity classes of functionscomputational complexitycounting classesdeterminism versus nondeterminismhighnessleaf languageslownesspolynomial hierarchyprobabilistic complexity classesreducibilitytime versus space

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 192916
• Theory of computation.
• scientific article; zbMATH DE number 44418
• Computational Complexity
• scientific article; zbMATH DE number 1418967

Cited in

(6)

• Complexity theory. Limits of the efficiency of algorithms
• Basic complexity
• scientific article; zbMATH DE number 3936519 (Why is no real title available?)
• Arithmetic theories for computational complexity problems
• scientific article; zbMATH DE number 46423 (Why is no real title available?)
• Observations on complete sets between linear time and polynomial time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520107)