[题解]ADS10 NP-Completeness

1.If L​1 ≤p L2 and L2∈NP, then L1∈NP.
T
注意<=p等价于reduce to，复杂的如果是Np，那么简单的也是NP

2.All NP-complete problems are NP problems.
T

3.All the languages can be decided by a non-deterministic machine.
F
不确定图灵机可以用来验证NP问题的解是否是正确的，确定图灵机可以用来求解P问题。

NP hard问题无法通过不确定图灵机验证

4.All NP problems can be solved in polynomial time in a non-deterministic machine.
T

5.If a problem can be solved by dynamic programming, it must be solved in polynomial time.
F

0-1背包问题可以用DP解，但是复杂度不是多项式的, 原因是输入的数据不是多项式的。

https://blog.csdn.net/cjjcy2003/article/details/5992232

6.Among the following problems, __ is NOT an NP-complete problem.

A.Vertex cover problem

B.Hamiltonian cycle problem

C.Halting problem

D.Satisfiability problem

D SAT问题是第一个被证明的NPC问题，A是NPC问题，B是汉密尔顿回路，NPC问题。C停机问题是不可解的，选C

7.Suppose Q is a problem in NP, but not necessarily NP-complete. Which of the following is FALSE?

A.A polynomial-time algorithm for SAT would sufficiently imply a polynomial-time algorithm for Q.

B.A polynomial-time algorithm for Q would sufficiently imply a polynomial-time algorithm for SAT.

C.If Q ∉P, then P≠NP.

D.If Q is NP-hard, then Q is NP-complete.

看上面的图，SAT是NPC问题，如果解决了，可以解决所有NP问题

B， Q不一定是NPC的，所以不对，C，如果Q不是P，那么说明NP没有被解决，D，NP-hard和NP交集是NPC

8.A language L belongs to NP iff there exist a two-input polynomial-time algorithm A that verifies language L in polynomial time.

T， 这是ppt上的

9.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.

B<= A，但是A是NPC问题，A<=B才能说明B也是NPC问题。

10.All decidable problems are NP problems.

F，还有NP hard问题

11.All NP problems are decidable.

T, 可以通过不确定图灵机判断

12.To prove problem B is NP-complete, we can use a NP-complete problem A and use a polynomial-time reduction algorithm to transform an instance of problem B to an instance of problem A.

F, 应该不是一个实例，而是整个问题

13.If P = NP then the Shortest-Path (finding the shortest path between a pair of given vertices in a given graph) problem is NP-complete.

T, P=NP说明所有的NP问题均可解，所有的NPC问题可解，NP=NPC