Faster optimal parallel prefix circuits: new algorithmic construction (Q852883)
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: Faster optimal parallel prefix circuits: new algorithmic construction |
scientific article; zbMATH DE number 5073050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster optimal parallel prefix circuits: new algorithmic construction |
scientific article; zbMATH DE number 5073050 |
Statements
Faster optimal parallel prefix circuits: new algorithmic construction (English)
0 references
15 November 2006
0 references
combinational circuits
0 references
depth
0 references
depth-size optimal
0 references
fan-out
0 references
parallel algorithms
0 references
prefix computation
0 references
size optimal
0 references
0.9553189873695374
0 references
0.921937882900238
0 references
0.9057642817497252
0 references
0.9051250219345092
0 references
