• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

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

Andris AmbainisWilliam I. GasarchAravind SrinivasanAndrey Utis
Published in: ACM Trans. Comput. Theory (2015)
Keyphrases
  • hamming distance
  • lower bound
  • upper bound
  • worst case
  • objective function
  • average case complexity
  • neural network
  • optimal solution
  • dynamic programming
  • pattern matching
  • branch and bound