A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions (Q3326839)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions |
scientific article |
Statements
A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions (English)
0 references
1982
0 references
Boolean function
0 references
lower bound
0 references
parallel random access machine
0 references
PRAM
0 references
