Login / Signup

Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems.

Andris AmbainisWilliam I. GasarchAravind SrinivasanAndrey Utis
Published in: ISAAC (2006)
Keyphrases
  • hamming distance
  • lower bound
  • upper bound
  • objective function
  • pattern recognition
  • pattern matching
  • data sets
  • data analysis
  • distance measure
  • hash functions
  • binary representation