Cell-probe lower bounds for the partial match problem (Q5917577)
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 2116231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cell-probe lower bounds for the partial match problem |
scientific article; zbMATH DE number 2116231 |
Statements
Cell-probe lower bounds for the partial match problem (English)
0 references
18 November 2004
0 references
Cell-probe model
0 references
Partial match problem
0 references
Nearest neighbor problem
0 references
Asymmetric communication complexity
0 references
0 references
0 references
0 references
0 references
1.0000001
0 references
0.89777803
0 references
0 references
0.89372337
0 references
0.8841074
0 references
0.88087285
0 references
0.87996006
0 references
0.8704916
0 references
0.8697872
0 references
0.86687666
0 references
