How do we know that all NP problems reduce to NP-hard problems? [duplicate]

cs.stackexchange https://cs.stackexchange.com/questions/19616

题

This question already has an answer here:

For example, how is it proven that any NP problem can reduce to subset sum, circuit satisfiability, etc.? Or could you link to a proof?

没有正确的解决方案

许可以下： CC-BY-SA 和 归因
不隶属于 cs.stackexchange
scroll top