Journal ArticleOPEN ACCESS

On the complexity of unique solutions

Papadimitriou C

Journal of the ACM (JACM) (1984) 31(2) 392-400

DOI: 10.1145/62.322435

59Citations

29Readers

Abstract

We show that the problem of deciding whether an instance of the traveling salesman problem has a uniquely optimal solution is complete for ∆p2. © 1984, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Papadimitriou, C. H. (1984). On the complexity of unique solutions. Journal of the ACM (JACM), 31(2), 392–400. https://doi.org/10.1145/62.322435