Abstract
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.
Get full access to this article
View all access options for this article.