scientific article; zbMATH DE number 1222922
From MaRDI portal
Publication:4218523
zbMath0922.03058MaRDI QIDQ4218523
Harry Buhrman, Leen Torenvliet
Publication date: 10 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reductionspolynomial timecomplexity classescomplete setsclasses of languagesoracle Turing machinesclass structureset structure
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10)
Related Items
Comparing reductions to NP-complete sets ⋮ Autoreducibility, mitoticity, and immunity ⋮ Axiomatizing Resource Bounds for Measure