Communication complexity of PRAMs (Q913504)
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 4147501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication complexity of PRAMs |
scientific article; zbMATH DE number 4147501 |
Statements
Communication complexity of PRAMs (English)
0 references
1990
0 references
communication complexity
0 references
complexity in parallel computing
0 references
sorting
0 references
computing
0 references
n point FFT graph
0 references
computing binary trees
0 references
LPRAM
0 references
parallel random access machines with local memory
0 references
arithmetic on semirings
0 references
0.8219165205955505
0 references
0.8167084455490112
0 references
0.8145678639411926
0 references
0.8145678639411926
0 references
