scientific article
From MaRDI portal
Publication:3778006
zbMath0637.03038MaRDI QIDQ3778006
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (9)
Uniformly hard languages. ⋮ Minimal pairs and complete problems ⋮ A characterization of the leaf language classes ⋮ On the relative complexity of hard problems for complexity classes without complete problems ⋮ The theory of the polynomial many-one degrees of recursive sets is undecidable ⋮ Many-one reductions and the category of multivalued functions ⋮ Differences between resource bounded degree structures ⋮ Undecidability results for low complexity time classes ⋮ Weak completeness notions for exponential time
This page was built for publication:
