The average case complexity of the parallel prefix problem (Q4632459)
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 7048707
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The average case complexity of the parallel prefix problem |
scientific article; zbMATH DE number 7048707 |
Statements
The average case complexity of the parallel prefix problem (English)
0 references
29 April 2019
0 references
average case
0 references
average delay
0 references
finite automaton
0 references
reachability problem
0 references
input gate
0 references
0 references
0.8299919962882996
0 references
0.8222361207008362
0 references
0.8179969191551208
0 references
0.8141804933547974
0 references
0.8083127737045288
0 references
