Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds (Q5230355)
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: Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds |
scientific article; zbMATH DE number 7097060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds |
scientific article; zbMATH DE number 7097060 |
Statements
Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds (English)
0 references
22 August 2019
0 references
cell-probe models
0 references
lower bounds
0 references
communication complexity
0 references
computational complexity
0 references
0.9956989884376526
0 references
0.8157079219818115
0 references
0.8050409555435181
0 references
0.7753283381462097
0 references
0.7641185522079468
0 references
