Complexity Theory

DOI10.1007/3-540-27477-4zbMath1066.68051OpenAlexW4243614269MaRDI QIDQ3156942

Ingo Wegener

Publication date: 12 January 2005

Full work available at URL: https://doi.org/10.1007/3-540-27477-4

zbMATH Keywords

approximation algorithmscomplexity classes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (20)

Black-box complexity: advantages of memory usage ⋮ Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics ⋮ A sprouting tree model for random boolean functions ⋮ Classification of Planar Upward Embedding ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Theory of interaction ⋮ Improving quantum computation by optimized qubit routing ⋮ Weighted Mutation of Connections To Mitigate Search Space Limitations in Cartesian Genetic Programming ⋮ Towards implementation of a generalized architecture for high-level quantum programming language ⋮ Precision, local search and unimodal functions ⋮ Recovery strategies from major supply disruptions in single and multiple sourcing networks ⋮ An evolutionary algorithm for robust regression ⋮ Biological computation of the solution to the quadratic assignment problem ⋮ Complexity and the Big Bang ⋮ On the expressiveness of interaction ⋮ On the complexity of the correctness problem for non-zeroness test instruction sequences ⋮ Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes ⋮ On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates ⋮ On the complexity of nonuniform wavelength-based machine ⋮ Equilibrium traffic flow assignment in a multi-subnet urban road network

This page was built for publication: Complexity Theory