• DocumentCode
    2188269
  • Title

    On the complexity of unique solutions

  • Author

    Papadimitriou, Christos H. ; Papadimitriou, Christos H. ; Papadimitriou, Christos H. ; Papadimitriou, Christos H.

  • fYear
    1982
  • fDate
    3-5 Nov. 1982
  • Firstpage
    14
  • Lastpage
    20
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1982. SFCS '08. 23rd Annual Symposium on
  • Conference_Location
    Chicago, IL, USA
  • ISSN
    0272-5428
  • Type

    conf

  • DOI
    10.1109/SFCS.1982.28
  • Filename
    4568369
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2188269