Login / Signup
Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance
Andris Ambainis
William I. Gasarch
Aravind Srinivasan
Andrey Utis
Published in:
CoRR (2004)
Keyphrases
</>
hamming distance
lower bound
upper bound
worst case
pattern matching
binary strings
distance measure
np hard
binary codes
average case complexity
edit distance
objective function
hash functions
hamming space