Theory of Computational Complexity
From MaRDI portal
Publication:5400669
DOI10.1002/9781118595091zbMath1433.68001OpenAlexW2482727859MaRDI QIDQ5400669
Publication date: 4 March 2014
Full work available at URL: https://doi.org/10.1002/9781118595091
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
A note on no-free-lunch theorem ⋮ Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device ⋮ GLOBAL ATTRACTIVITY, ASYMPTOTIC STABILITY AND BLOW-UP POINTS FOR NONLINEAR FUNCTIONAL-INTEGRAL EQUATIONS’ SOLUTIONS AND APPLICATIONS IN BANACH SPACE BC(R+) WITH COMPUTATIONAL COMPLEXITY ⋮ Black-Box and Data-Driven Computation ⋮ On the relationship between energy complexity and other Boolean function measures ⋮ A dichotomy result for cyclic-order traversing games
This page was built for publication: Theory of Computational Complexity
