Abstract

In this paper we study the complexity of the following feasibility problem: given an n×n similarity matrix S as input, is there a locality sensitive hash (LSH) for S? We show that the LSH feasibility problem is NP-hard even in the following strong promise version: either S admits an LSH or S is at ℓ1-distance at least n2−ϵ from every similarity that admits an LSH. We complement this hardness result by providing an O˜(3n) algorithm for the LSH feasibility problem, which improves upon the naïve nΘ(n) time algorithm; we prove that this running time is tight, modulo constants, under the Exponential Time Hypothesis.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.