Social Sciences, asked by srai4437, 11 months ago

Suppose sat reduces to a problem
c. To claim that c is npcomplete, we additionally need to show that:

Answers

Answered by jeevankanha2021
0

Answer : There is a checking algorithm for c

Explanation:

Similar questions