Conditional Indexing Lower Bounds Through Self-Reducibility

02/03/2020
by   Massimo Equi, et al.
0

We provide a general technique to turn a conditional lower bound result based on the Orthogonal Vectors Hypothesis (OVH) into one for the indexed version of the same problem. This consists of two results that hold under OVH: (i) the Orthogonal Vectors (OV) problem cannot be indexed in polynomial time to support sub-quadratic time queries, and (ii) any problem to which OV reduces with a natural property also cannot be indexed in polynomial time to support fast queries. We demonstrate the power of this technique on the problem of exact string matching on graphs, deriving the first, and tight, conditional lower bound for its indexed version. The result has an interesting corollary for automata theory: Unless OVH is false, there is no polynomial determinisation algorithm of a finite automaton, even for an acyclic non-deterministic automata whose only non-deterministic transitions are from the start state. For another example of the use of the technique, we apply it to the reduction by Backurs and Indyk (STOC 2015) on edit distance. This results into the first tight conditional indexing lower bound for approximate string matching. This strengthens the recent tailored reduction by Cohen-Addad, Feuilloley and Starikovskaya (SODA 2019), but with a slightly different boundary condition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2020

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails

We consider the following string matching problem on a node-labeled grap...
research
02/19/2019

Lower bounds on separation automata for Parity Games

Several recently developed quasi-polynomial time algorithms for Parity G...
research
02/10/2019

On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching

Exact pattern matching in labeled graphs is the problem of searching pat...
research
12/21/2018

Lower bounds for text indexing with mismatches and differences

In this paper we study lower bounds for the fundamental problem of text ...
research
01/16/2019

On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree

Exact pattern matching in labeled graphs is the problem of searching pat...
research
05/02/2023

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality

Seminal results establish that the coverability problem for Vector Addit...
research
05/12/2022

Orthogonal Gromov-Wasserstein Discrepancy with Efficient Lower Bound

Comparing structured data from possibly different metric-measure spaces ...

Please sign up or login with your details

Forgot password? Click here to reset