scientific article; zbMATH DE number 1414313
From MaRDI portal
Publication:4942650
zbMath0941.03541MaRDI QIDQ4942650
Osamu Watanabe, Seinosuke Toda, Thomas Thierauf
Publication date: 16 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items (4)
NP-hard sets are superterse unless NP is small ⋮ Quasi-linear truth-table reductions to \(p\)-selective sets ⋮ On membership comparable sets ⋮ Computing functions with parallel queries to NP
This page was built for publication:
