The complexity of a multiprocessor task assignment problem without deadlines (Q1155958)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of a multiprocessor task assignment problem without deadlines |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of a multiprocessor task assignment problem without deadlines |
scientific article |
Statements
The complexity of a multiprocessor task assignment problem without deadlines (English)
0 references
1982
0 references
