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

Tue, 01 Jan 2002 00:00:00 +0100

Douglas Bauer , Hajo Broersma , Aurora Morgana, Edward F. Schmeichel:
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discret. Appl. Math. 120(1-3): 13-23 (2002)