原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
few things to keep in mind and some strategies that you can often bring to bear. Pitfalls
Make sure that you don’t get the reduction backward. That is, in trying to show that problem Y is NP-complete, you might take a known NP-complete problem X and give a polynomial-time reduction from Y to X. That is the wrong direction. The reduction should be from X to Y, so that a solution to Y gives a solution to X. Remember also that reducing
a known NP-complete problem X to a problem Y does not in itself prove that Y is NP-comple
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea