More complicated questions about maxima and minima, and some closures of NP
Open Access
- 1 January 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 51 (1-2) , 53-80
- https://doi.org/10.1016/0304-3975(87)90049-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1985
- On the complexity of unique solutionsJournal of the ACM, 1984
- On ω-regular setsInformation and Control, 1979
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975