Some new results in the complexity of allocation and binding in data path synthesis (Q1608404)
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: Some new results in the complexity of allocation and binding in data path synthesis |
scientific article; zbMATH DE number 1776610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some new results in the complexity of allocation and binding in data path synthesis |
scientific article; zbMATH DE number 1776610 |
Statements
Some new results in the complexity of allocation and binding in data path synthesis (English)
0 references
6 August 2002
0 references
data path synthesis
0 references
allocation
0 references
binding problems
0 references
0.8087993860244751
0 references
0.799326479434967
0 references
0.7653070688247681
0 references
0.7328054308891296
0 references
