Why any problem can be reduced to SAT is NP-Complete?
-
05-11-2019 - |
Question
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.
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange