scientific article; zbMATH DE number 1555954
From MaRDI portal
Publication:4525724
zbMath0953.68546MaRDI QIDQ4525724
Sebastiaan A. Terwijn, Zheng, Xizhong, Ambos-Spies, Klaus
Publication date: 24 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Distributed algorithms (68W15)
Related Items (9)
NP-hard sets are superterse unless NP is small ⋮ Unnamed Item ⋮ Genericity and measure for exponential time ⋮ An excursion to the Kolmogorov random strings ⋮ Weakly complete problems are not rare ⋮ Subcomputable Hausdorff function dimension ⋮ Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) ⋮ Genericity and measure for exponential time ⋮ Resource bounded randomness and computational complexity
This page was built for publication:
