Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Mitsuya, Shiori"'
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) problem in the setting where the two parties have their strings in a
Externí odkaz:
http://arxiv.org/abs/2103.03468
