On the bitprobe complexity of two probe adaptive schemes storing two elements (Q2326565)
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 bitprobe complexity of two probe adaptive schemes storing two elements |
scientific article; zbMATH DE number 7115804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the bitprobe complexity of two probe adaptive schemes storing two elements |
scientific article; zbMATH DE number 7115804 |
Statements
On the bitprobe complexity of two probe adaptive schemes storing two elements (English)
0 references
10 October 2019
0 references
data structures
0 references
bitprobe model
0 references
adaptive scheme
0 references
lower bound
0 references
0.9392940402030944
0 references
0.9281244874000548
0 references
0.9030427932739258
0 references
0.9001057147979736
0 references
0.8969411849975586
0 references
