Complexity Theory
From MaRDI portal
Publication:3156942
DOI10.1007/3-540-27477-4zbMath1066.68051MaRDI QIDQ3156942
Publication date: 12 January 2005
Full work available at URL: https://doi.org/10.1007/3-540-27477-4
68Q25: Analysis of algorithms and problem complexity
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Complexity and the Big Bang, Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes, On the complexity of nonuniform wavelength-based machine, Black-box complexity: advantages of memory usage, Precision, local search and unimodal functions, Theory of interaction, Biological computation of the solution to the quadratic assignment problem, On the expressiveness of interaction, Towards implementation of a generalized architecture for high-level quantum programming language, Recovery strategies from major supply disruptions in single and multiple sourcing networks, On the complexity of the correctness problem for non-zeroness test instruction sequences, Equilibrium traffic flow assignment in a multi-subnet urban road network, On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates, An evolutionary algorithm for robust regression, Classification of Planar Upward Embedding, Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics, A sprouting tree model for random boolean functions
