On the complexity of parallelizing sequential circuits using the parallel-prefix method (Q4540097)
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: On the complexity of parallelizing sequential circuits using the parallel-prefix method |
scientific article; zbMATH DE number 1769340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of parallelizing sequential circuits using the parallel-prefix method |
scientific article; zbMATH DE number 1769340 |
Statements
On the complexity of parallelizing sequential circuits using the parallel-prefix method (English)
0 references
21 July 2002
0 references
discrete-time iteration bound
0 references
parallel processing
0 references
prefix problem
0 references
parallel-prefix method
0 references
finite-state machine
0 references
sequential circuits
0 references
0.7829145193099976
0 references
0.7499352693557739
0 references
0.7419463396072388
0 references
0.7414734363555908
0 references
