On the structure of combinatorial problems and structure preserving reductions
- 1 January 1977
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- On isomorphisms and density of NP and other complete setsPublished by Association for Computing Machinery (ACM) ,1976
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- P-complete problems and approximate solutionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971