scientific article; zbMATH DE number 2081094
From MaRDI portal
Publication:4474207
zbMath1052.68047MaRDI QIDQ4474207
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2245/22450058.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
Randomness buys depth for approximate counting ⋮ The complexity of satisfiability problems: Refining Schaefer's theorem
This page was built for publication:
