On the Computational Complexity of a Generalized Scheduling Problem
From MaRDI portal
Publication:4136565
DOI10.1109/TC.1976.1674556zbMath0362.68079MaRDI QIDQ4136565
K. Vairavan, Richard A. DeMillo
Publication date: 1976
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (1)
This page was built for publication: On the Computational Complexity of a Generalized Scheduling Problem