Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' (Q447565): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q58698841, #quickstatements; #temporary_batch_1707303357582 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58698841 / rank | |||
Normal rank | |||
Revision as of 12:32, 7 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' |
scientific article |
Statements
Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' (English)
0 references
4 September 2012
0 references
