To prove problem B is NP-complete, we can use a NP-complete pro

To prove problem B is NP-complete, we can use a NP-complete problem A and use a polynomial-time reduction algorithm to transform an instance of problem B to an instance of problem A. ~@[](1)

答案：FALSE