New Unconditional Hardness Results for Dynamic and Online Problems

There has been a resurgence of interest in lower bounds whose truth rests on the conjectured hardness of well known computational problems. These conditional lower bounds have become important and popular due to the painfully slow progress on proving strong unconditional lower bounds. Nevertheless, the long term goal is to replace these conditional bounds with unconditional ones. In this paper we make progress in this direction by studying the cell probe complexity of two conjectured to be hard problems of particular importance: matrix-vector multiplication and a version of dynamic set disjointness known as Patrascu's Multiphase Problem. We give improved unconditional lower bounds for these problems as well as introducing new proof techniques of independent interest. These include a technique capable of proving strong threshold lower bounds of the following form: If we insist on having a very fast query time, then the update time has to be slow enough to compute a lookup table with the answer to every possible query. This is the first time a lower bound of this type has been proven.

[1]  Mihai Patrascu,et al.  Unifying the Landscape of Cell-Probe Lower Bounds , 2010, SIAM J. Comput..

[2]  Rina Panigrahy,et al.  Lower Bounds on Near Neighbor Search via Metric Expansion , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[3]  Mark H. Overmars,et al.  On a Class of O(n2) Problems in Computational Geometry , 1995, Comput. Geom..

[4]  Raphaël Clifford,et al.  Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model , 2011, ICALP.

[5]  Marvin Künnemann,et al.  Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[6]  Kasper Green Larsen.  Higher Cell Probe Lower Bounds for Evaluating Polynomials , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[7]  Peter Bro Miltersen.  Lower bounds for union-split-find related problems on random access machines , 1994, STOC '94.

[8]  Erik D. Demaine,et al.  Logarithmic Lower Bounds in the Cell-Probe Model , 2005, SIAM J. Comput..

[9]  Amir Abboud,et al.  Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[10]  Raphaël Clifford,et al.  Cell-probe bounds for online edit distance and other pattern matching problems , 2015, SODA.

[11]  Mihai Pa caron,et al.  Unifying the Landscape of Cell-Probe Lower Bounds , 2011 .

[12]  Mikkel Thorup,et al.  Time-space trade-offs for predecessor search , 2006, STOC '06.

[13]  Karl Bringmann,et al.  Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[14]  Michael E. Saks,et al.  The cell probe complexity of dynamic data structures , 1989, STOC '89.

[15]  Martti Penttonen,et al.  A Reliable Randomized Algorithm for the Closest-Pair Problem , 1997, J. Algorithms.

[16]  Mihai Patrascu,et al.  On the possibility of faster SAT algorithms , 2010, SODA '10.

[17]  Michael L. Fredman.  Observations on the Complexity of Generating Quasi-Gray Codes , 1978, SIAM J. Comput..

[18]  Mikkel Thorup,et al.  Higher Lower Bounds for Near-Neighbor and Further Rich Problems , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[19]  Peter Bro Miltersen,et al.  Lower Bounds for Dynamic Algebraic Problems , 1998, Inf. Comput..

[20]  Mihai Patrascu,et al.  Towards polynomial lower bounds for dynamic problems , 2010, STOC '10.

[21]  Monika Henzinger,et al.  Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.

[22]  Marvin Minsky,et al.  Perceptrons: An Introduction to Computational Geometry , 1969 .

[23]  Peter Bro Miltersen,et al.  On data structures and asymmetric communication complexity , 1994, STOC '95.

[24]  Mikkel Thorup,et al.  Don't rush into a union: take time to find your roots , 2011, STOC '11.

[25]  Piotr Indyk,et al.  Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) , 2014, STOC.

[26]  Kasper Green Larsen.  The cell probe complexity of dynamic range counting , 2011, STOC '12.

[27]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[28]  Liam Roditty,et al.  Fast approximation algorithms for the diameter and radius of sparse graphs , 2013, STOC '13.

[29]  Oren Weimann,et al.  Consequences of Faster Alignment of Sequences , 2014, ICALP.

[30]  Andrew Chi-Chih Yao,et al.  Should Tables Be Sorted? , 1981, JACM.

[31]  Raphaël Clifford,et al.  Tight Cell-Probe Bounds for Online Hamming Distance Computation , 2013, SODA.

[32]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .