论文信息 - On the complexity of unique solutions - 字舞流文

On the complexity of unique solutions

We show that the problem of deciding whether an instance of the traveling salesman problem has a uniquely optimal solution is complete for Δ2P.

Christos H. Papadimitriou

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[2] Mihalis Yannakakis,et al. The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[3] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[4] Thomas J. Schaefer,et al. On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..

[5] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[6] Christos H. Papadimitriou,et al. Flowshop scheduling with limited temporary storage , 1980, JACM.

[7] Christos H. Papadimitriou,et al. The adjacency relation on the traveling salesman polytope is NP-Complete , 1978, Math. Program..