Compressed Communication Complexity of Hamming Distance

Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga +2

We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP…