Theory of Computational Complexity
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) 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 1418967
- 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
(14)- Theories of computational complexity
- Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
- Complexity theory
- Complexity Dichotomies for Counting Problems
- A note on no-free-lunch theorem
- A dichotomy result for cyclic-order traversing games
- 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
- scientific article; zbMATH DE number 2243558 (Why is no real title available?)
- Computational Complexity
- On the relationship between energy complexity and other Boolean function measures
- Computability and complexity theory
- The optimal causal linear predictor is not Turing computable
- The complexity of computing second solutions
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)
