scientific article
From MaRDI portal
Publication:3705435
zbMath0582.03023MaRDI QIDQ3705435
Publication date: 1985
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) Turing machines and related notions (03D10)
Related Items (5)
The structure of the honest polynomial m-degrees ⋮ Honest polynomial degrees and \(P=?NP\) ⋮ Honest polynomial time reducibilities and the \(P=?NP\) problem ⋮ On computational complexity and honest polynomial degrees ⋮ On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets
This page was built for publication:
