判断题：A Statement on NP-Complete Problems

A problem is NP-complete if and only if it is in $$\mathcal{NP}$$ and there is no polynomial time algorithms for it.

答案：FALSE