scientific article

zbMath0598.03030MaRDI QIDQ3731587

Uwe Schoening

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

infinite hierarchy of polynomial-time reducibilitiespolynomial-time Turing reducibility

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Hard promise problems and nonuniform complexity