ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES (Q5286031)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 223395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES |
scientific article; zbMATH DE number 223395 |
Statements
ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES (English)
0 references
29 June 1993
0 references
NP-completeness
0 references
approximation algorithms
0 references
mapping problem
0 references
0.771385669708252
0 references
0.768204927444458
0 references
0.7631250023841858
0 references
