Author:
Mandal C.A.,Chakrabarti P.P.,Ghose S.
Subject
Computational Mathematics,Computational Theory and Mathematics,Modeling and Simulation
Reference9 articles.
1. A Guide to the Theory of NP-Completeness;Garey,1979
2. Computer and Job Shop Scheduling Theory,1976
3. Complexity results and algorithms for {<, ≤, =}-constrained scheduling;Berger,1991
4. C.A. Mandal, P.P. Chakrabarti and S. Ghose, Complexity of scheduling in high level synthesis, VLSI Design (to appear).
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献