Poly-time reduction: D and D Comp
Independent set and its complement are NP-complete and co-NP-complete, respectively. If you found a polynomial-time reduction between those two problems, you'd have proven that NP$\,=\,$co-NP, resolving one of the biggest open problems in theoretical CS.