 This reducibility is, essentially, a resource-bounded version of many-one reducibility.Other resource-bounded reducibilities are used in other contexts of computational complexity theory where other resource bounds are of interest.Although Turing reducibility is the most general reducibility that is effective, weaker reducibility relations are commonly studied.