Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.

Douglas Bauer Hajo Broersma Aurora Morgana Edward F. Schmeichel Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. 13-23 2002 120 Discrete Applied Mathematics 1-3 db/journals/dam/dam120.html#BauerBMS02 http://dx.doi.org/10.1016/S0166-218X(01)00276-1