Title :
On the complexity of unique solutions
Author :
Papadimitriou, Christos H. ; Papadimitriou, Christos H. ; Papadimitriou, Christos H. ; Papadimitriou, Christos H.
Abstract :
We show that the problem of deciding whether an instance of the traveling salesman problem has a uniquely optimal solution is complete for Δ2P.
Keywords :
Calculus; Costs; Encoding; Polynomials; Soil; Tiles; Traveling salesman problems; Turing machines;
Conference_Titel :
Foundations of Computer Science, 1982. SFCS '08. 23rd Annual Symposium on
Conference_Location :
Chicago, IL, USA
DOI :
10.1109/SFCS.1982.28
