The complexity of optimization problems
Author:
- Mark W. KrentelMKMark W. Krentel
Open Access
- 1 June 1988
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 36 (3) , 490-509
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984
- On the complexity of unique solutionsJournal of the ACM, 1984
- AlternationJournal of the ACM, 1981
- The complexity of computing the permanentTheoretical Computer Science, 1979
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975