Polynomial complete scheduling problems
- 1 January 1973
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 7 (4) , 96-101
- https://doi.org/10.1145/957195.808055
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Complete register allocation problemsPublished by Association for Computing Machinery (ACM) ,1973
- Some related problems from network flows, game theory and integer programmingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Optimal Sequencing of Two Equivalent ProcessorsSIAM Journal on Applied Mathematics, 1969