The complexity of a multiprocessor task assignment problem without deadlines (Q1155958): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4131987 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Latest revision as of 12:37, 13 June 2024
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
