On the Computational Complexity of a Generalized Scheduling Problem

DOI10.1109/TC.1976.1674556zbMATH Open0362.68079MaRDI QIDQ4136565FDOQ4136565

K. Vairavan, Richard A. DeMillo

Publication date: 1976

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited In (1)

• LAPLACE -- an experimental language for parallel programming of MHD- models in plasma physics

This page was built for publication: On the Computational Complexity of a Generalized Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136565)