The complexity of facets resolved
- 1 August 1988
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 37 (1) , 2-13
- https://doi.org/10.1016/0022-0000(88)90042-6
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The two-processor scheduling problem is in R-NCPublished by Association for Computing Machinery (ACM) ,1985
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984
- On the unique satisfiability problemInformation and Control, 1982
- On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and FacetsMathematics of Operations Research, 1980
- On the symmetric travelling salesman problem II: Lifting theorems and facetsMathematical Programming, 1979
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975