单选题：Some Statements on Complexity Theory
How many of the following statements are correct?
* If some NP-complete problem can be solved in polynomial time, then $$\mathcal{P}=\mathcal{NP}$$.
* Given enough computational resources, for example time and space, any problem can be solved by a computer,
* If a problem $$A$$ can be reduced to problem $$B$$ in polynomial time, then problem $$B$$ can also be reduced to problem $$A$$ in polynomial time.
A.0
B.1
C.2
D.3
答案：B
* If some NP-complete problem can be solved in polynomial time, then $$\mathcal{P}=\mathcal{NP}$$.
* Given enough computational resources, for example time and space, any problem can be solved by a computer,
* If a problem $$A$$ can be reduced to problem $$B$$ in polynomial time, then problem $$B$$ can also be reduced to problem $$A$$ in polynomial time.
A.0
B.1
C.2
D.3
答案：B