Turing reduction
Mahaney's theorem is a theorem in computational complexity theory proven by Stephen Mahaney that states that if any sparse language is NP-complete, then P = NP. Also, if there is a Turing reduction from such NP-complete sparse language to a language in P, then the polynomial-time hierarchy collapses to formula_1.