On the complexity of unique solutions
- 30 March 1984
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 31 (2) , 392-400
- https://doi.org/10.1145/62.322435
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Covering Graphs by Simple CircuitsSIAM Journal on Computing, 1981
- Flowshop scheduling with limited temporary storageJournal of the ACM, 1980
- The adjacency relation on the traveling salesman polytope is NP-CompleteMathematical Programming, 1978
- On the complexity of some two-person perfect-information gamesJournal of Computer and System Sciences, 1978
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972