A language L ⊆ {0, 1}$$^{\ast}$$ is NP-complete if there exist

A language L ⊆ {0, 1}$$^{\ast}$$ is NP-complete if there exists a language L'⊆ {0, 1}$$^{\ast}$$ that L' $$\le _{p}$$ L and L'∈ NP. ~@[](1)

答案：FALSE