scientific article
From MaRDI portal
Publication:3337457
zbMath0546.03020MaRDI QIDQ3337457
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
Diagonalizations over polynomial time computable sets ⋮ Autoreducibility and mitoticity of logspace-complete sets for NP and other classes ⋮ Autoreducibility, mitoticity, and immunity ⋮ Introduction to Autoreducibility and Mitoticity ⋮ Non-uniform reductions ⋮ Space-efficient informational redundancy ⋮ Autoreducibility of NP-complete sets under strong hypotheses ⋮ The complexity of unions of disjoint sets ⋮ On the autoreducibility of functions ⋮ Non-mitotic Sets ⋮ Non-mitotic sets ⋮ Some observations on mitotic sets
