Generalized Polynomial-Time Reducibilities, Degrees and NP-Completeness
Uwe Schöning · Fundamenta Informaticae · 1984
An infinite hierarchy of polynomial-time reducibilities is introduced which generalizes the notion of polynomial-time Turing reducibility and strong nondeterministic polynomial-time Turing reducibility.