Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry

Fine-grained complexity theory is the area of theoretical computer science that proves conditional lower bounds based on the Strong Exponential Time Hypothesis and similar conjectures. This area has been thriving in the last decade, leading to conditionally best-possible algorithms for a wide variety of problems on graphs, strings, numbers etc. This article is an introduction to fine-grained lower bounds in computational geometry, with a focus on lower bounds for polynomial-time problems based on the Orthogonal Vectors Hypothesis. Specifically, we discuss conditional lower bounds for nearest neighbor search under the Euclidean distance and Fréchet distance.

[1]  Huacheng Yu,et al.  More Applications of the Polynomial Method to Algorithm Design , 2015, SODA.

[2]  Aviad Rubinstein,et al.  SETH vs Approximation , 2019, SIGA.

[3]  Christos Tzamos,et al.  Tight Hardness Results for Maximum Weight Rectangles , 2016, ICALP.

[4]  Karl Bringmann,et al.  Fine-Grained Complexity Theory (Tutorial) , 2019, STACS.

[5]  Russell Impagliazzo,et al.  Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[6]  Amir Abboud,et al.  Tight Hardness Results for LCS and Other Sequence Similarity Measures , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[7]  Bettina Speckmann,et al.  SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension , 2019, SODA.

[8]  Wolfgang Mulzer,et al.  Approximability of the discrete Fréchet distance , 2015, J. Comput. Geom..

[9]  M. Buchin,et al.  Fine-Grained Analysis of Problems on Curves , 2016 .

[10]  Karl Bringmann,et al.  Tighter Connections Between Formula-SAT and Shaving Logs , 2018, ArXiv.

[11]  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.

[12]  H. Mannila,et al.  Computing Discrete Fréchet Distance ∗ , 1994 .

[13]  Timothy M. Chan,et al.  An improved approximation algorithm for the discrete Fréchet distance , 2018, Inf. Process. Lett..

[14]  Lijie Chen,et al.  On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product , 2018, Electron. Colloquium Comput. Complex..

[15]  Sariel Har-Peled,et al.  Approximating the Fréchet Distance for Realistic Curves in Near Linear Time , 2010, Discrete & Computational Geometry.

[16]  Russell Impagliazzo,et al.  Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility , 2016, Electron. Colloquium Comput. Complex..

[17]  Marvin Künnemann,et al.  Multivariate Fine-Grained Complexity of Longest Common Subsequence , 2018, SODA.

[18]  V. V. Williams.  ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY , 2019, Proceedings of the International Congress of Mathematicians (ICM 2018).

[19]  Haim Kaplan,et al.  Computing the Discrete Fréchet Distance in Subquadratic Time , 2012, SIAM J. Comput..

[20]  Karl Bringmann,et al.  Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation , 2021, SoCG.

[21]  Karl Bringmann,et al.  Polyline Simplification has Cubic Complexity , 2018, SoCG.

[22]  Marvin Künnemann,et al.  Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds , 2014, Int. J. Comput. Geom. Appl..

[23]  Sariel Har-Peled,et al.  Approximating the Fréchet Distance for Realistic Curves in Near Linear Time , 2012, Discret. Comput. Geom..

[24]  Marvin Künnemann,et al.  Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability , 2019, SODA.

[25]  Russell Impagliazzo,et al.  On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..

[26]  Ryan Williams,et al.  A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..

[27]  Ryan Williams,et al.  Probabilistic Polynomials and Hamming Nearest Neighbors , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

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

[29]  Helmut Alt,et al.  Computing the Fréchet distance between two polygonal curves , 1995, Int. J. Comput. Geom. Appl..

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

[31]  Aviad Rubinstein,et al.  Hardness of approximate nearest neighbor search , 2018, STOC.

[32]  Ryan Williams,et al.  On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity , 2017, SODA.

[33]  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.

[34]  Chak-Kuen Wong,et al.  Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees , 1977, Acta Informatica.