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

D. Bauer, Haitze J. Broersma, A. Morgana, E. Schmeichel

Research output: Book/Report › Report › Professional

121 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion'. Together they form a unique fingerprint.