Communication Complexity of Computing the Hamming Distance (Q3756524)
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 4005617
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication Complexity of Computing the Hamming Distance |
scientific article; zbMATH DE number 4005617 |
Statements
Communication Complexity of Computing the Hamming Distance (English)
0 references
1986
0 references
communication complexity
0 references
randomized protocol
0 references
combinatorial extremal problem
0 references
Hamming distance
0 references
0.8818044662475586
0 references
0.8627201318740845
0 references
0.8617302775382996
0 references
0.8564485311508179
0 references
0.8345576524734497
0 references
