单选题：If P and NP are different, which of the following statements is
If P and NP are different, which of the following statements is true? @[A](2)
A. There is no polynomial time algorithm to solve the vertex cover problem.
B. P $$\cap$$ NP-Complete ≠ $$\emptyset$$.
C. We can find polynomial time solution for Hamilton cycle problem.
D. P = NP-Complete.
A.There is no polynomial time algorithm to solve the vertex cover problem.
B.P $$\cap$$ NP-Complete ≠ $$\emptyset$$.
C.We can find polynomial time solution for Hamilton cycle problem.
D.P = NP-Complete.
答案：A
A. There is no polynomial time algorithm to solve the vertex cover problem.
B. P $$\cap$$ NP-Complete ≠ $$\emptyset$$.
C. We can find polynomial time solution for Hamilton cycle problem.
D. P = NP-Complete.
A.There is no polynomial time algorithm to solve the vertex cover problem.
B.P $$\cap$$ NP-Complete ≠ $$\emptyset$$.
C.We can find polynomial time solution for Hamilton cycle problem.
D.P = NP-Complete.
答案：A