scientific article
From MaRDI portal
Publication:3220571
zbMath0556.03032MaRDI QIDQ3220571
Hagen Huwig, Ambos-Spies, Klaus, Hans Fleischhack
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (3)
Diagonalizations over polynomial time computable sets ⋮ Generic objects in recursion theory. II: Operations on recursive approximation spaces ⋮ Complexity of the \(r\)-query tautologies in the presence of a generic oracle
This page was built for publication:
