Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems (Q2828234)
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: Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems |
scientific article; zbMATH DE number 6642933
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems |
scientific article; zbMATH DE number 6642933 |
Statements
24 October 2016
0 references
communication complexity
0 references
Hamming distance
0 references
0.9984609
0 references
0.90800744
0 references
0.9034048
0 references
0.9034048
0 references
0.90109444
0 references
0.89109194
0 references
0.8909781
0 references
0.87743217
0 references
0.8771761
0 references
0.8745689
0 references
Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems (English)
0 references
