Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel. Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discrete Applied Mathematics, 120(1-3):13-23, 2002.
Abstract is missing.