License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2019.14
URN: urn:nbn:de:0030-drops-104853
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10485/
Go to the corresponding LIPIcs Volume Portal


Labib, Karim ; Uznanski, Przemyslaw ; Wolleb-Graf, Daniel

Hamming Distance Completeness

pdf-format:
LIPIcs-CPM-2019-14.pdf (0.7 MB)


Abstract

We show, given a binary integer function diamond that is piecewise polynomial, that (+,diamond) vector products are equivalent under one-to-polylog reductions to the computation of the Hamming distance. Examples include the dominance and l_{2p+1} distances for constant p. Our results imply equivalence (up to polylog factors) between the complexity of computing All Pairs Hamming Distance, All Pairs l_{2p+1} Distance and Dominance Matrix Product, and equivalence between Hamming Distance Pattern Matching, l_{2p+1} Pattern Matching and Less-Than Pattern Matching. The resulting algorithms for l_{2p+1} Pattern Matching and All Pairs l_{2p+1}, for 2p+1 = 3,5,7,... are likely to be optimal, given lack of progress in improving upper bounds for Hamming distance in the past 30 years. While reductions between selected pairs of products were presented in the past, our work is the first to generalize them to a general class of functions, showing that a wide class of "intermediate" complexity problems are in fact equivalent.

BibTeX - Entry

@InProceedings{labib_et_al:LIPIcs:2019:10485,
  author =	{Karim Labib and Przemyslaw Uznanski and Daniel Wolleb-Graf},
  title =	{{Hamming Distance Completeness}},
  booktitle =	{30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)},
  pages =	{14:1--14:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-103-0},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{128},
  editor =	{Nadia Pisanti and Solon P. Pissis},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10485},
  URN =		{urn:nbn:de:0030-drops-104853},
  doi =		{10.4230/LIPIcs.CPM.2019.14},
  annote =	{Keywords: fine grained complexity, approximate pattern matching, matrix products}
}

Keywords: fine grained complexity, approximate pattern matching, matrix products
Collection: 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)
Issue Date: 2019
Date of publication: 06.06.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI