Why any problem can be reduced to SAT is NP-Complete?

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

题

I have a book statement says the title, I don't understand it. From my current understanding if a problem A can be reduced to a problem B then it only means B is at least as difficult as A.

没有正确的解决方案

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