Toward a unified approach for the classification of NP-complete optimization problems
- 30 September 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 12 (1), 83-96
- https://doi.org/10.1016/0304-3975(80)90006-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969
- Limiting recursionThe Journal of Symbolic Logic, 1965