scientific article
From MaRDI portal
Publication:3765753
zbMath0629.03014MaRDI QIDQ3765753
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
promise problemsoracle Turing machine\({\mathcal N}{\mathcal P}\)-hardnessCantor-set topologyUniform Boundedness Theorem
Analysis of algorithms and problem complexity (68Q25) 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 (1)
This page was built for publication:
