Theory of Computational Complexity

DOI10.1002/9781118595091MaRDI QIDQ5400669zbMATH OpenOpenAlexFDO

Authors Du Ding-Zhu, Ker-I Ko

Publication date 4 March 2014

Full work available at URL https://doi.org/10.1002/9781118595091

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Publication:4942157
• Theories of computational complexity
• Complexity theory and theory of algorithms
• Computability and complexity theory
• Theory of computation
• scientific article; zbMATH DE number 194974
• scientific article; zbMATH DE number 6164359
• scientific article; zbMATH DE number 2090609
• Complexity theory
• Complexity theory

Cited in

(11)

• Theories of computational complexity
• Complexity theory
• Computational Complexity
• Black-Box and Data-Driven Computation
• Global attractivity, asymptotic stability and blow-up points for nonlinear functional-integral equations' solutions and applications in Banach space \(BC( R_+)\) with computational complexity
• scientific article; zbMATH DE number 2243558 (Why is no real title available?)
• A note on no-free-lunch theorem
• Computability and complexity theory
• A dichotomy result for cyclic-order traversing games
• Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
• On the relationship between energy complexity and other Boolean function measures

This page was built for publication: Theory of Computational Complexity

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