Given that problem A is NP-complete. If problem B is in NP and

Given that problem A is NP-complete. If problem B is in NP and can be polynomially reduced to problem A, then problem B is NP-complete. ~@[](2)

答案：FALSE