ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY

In recent years, a new “fine-grained” theory of computational hardness has been developed, based on “fine-grained reductions” that focus on exact running times for problems. Mimicking NP-hardness, the approach is to (1) select a key problem X that for some function t , is conjectured to not be solvable by any O(t(n)1 ") time algorithm for " > 0, and (2) reduce X in a fine-grained way to many important problems, thus giving tight conditional time lower bounds for them. This approach has led to the discovery of many meaningful relationships between problems, and to equivalence

[1]  L. Fortnow,et al.  Computational Complexity , 2009, Springer New York.

[2]  Liam Roditty,et al.  Towards tight approximation bounds for graph diameter and eccentricities , 2018, STOC.

[3]  Karl Bringmann,et al.  More consequences of falsifying SETH and the orthogonal vectors conjecture , 2018, STOC.

[4]  Karl Bringmann,et al.  Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars , 2018, CPM.

[5]  Richard Ryan Williams,et al.  Tight Hardness for Shortest Cycles and Paths in Sparse Graphs , 2017, SODA.

[6]  Erik D. Demaine,et al.  Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy , 2017, ITCS.

[7]  Marvin Künnemann,et al.  Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[8]  Karl Bringmann,et al.  Brief Announcement: A Note on Hardness of Diameter Approximation , 2017, DISC.

[9]  François Le Gall,et al.  Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor , 2017, SODA.

[10]  Richard Ryan Williams,et al.  Distributed PCP Theorems for Hardness of Approximation in P , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[11]  Prashant Nalini Vasudevan,et al.  Average-case fine-grained hardness , 2017, Electron. Colloquium Comput. Complex..

[12]  Shachar Lovett,et al.  Near-optimal linear decision trees for k-SUM and related problems , 2017, Electron. Colloquium Comput. Complex..

[13]  D. Hermelin,et al.  SETH-based Lower Bounds for Subset Sum and Bicriteria Path , 2017, SODA.

[14]  Aleksander Madry,et al.  Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[15]  Piotr Indyk,et al.  On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks , 2017, NIPS.

[16]  Mathias Bæk Tejs Knudsen,et al.  Finding even cycles faster via capped k-walks , 2017, STOC.

[17]  Karl Bringmann,et al.  Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can) , 2017, SODA.

[18]  Marvin Künnemann,et al.  On the Fine-grained Complexity of One-Dimensional Dynamic Programming , 2017, ICALP.

[19]  Robert Krauthgamer,et al.  Conditional Lower Bounds for All-Pairs Max-Flow , 2017, ICALP.

[20]  Russell Impagliazzo,et al.  Completeness for First-order Properties on Sparse Structures with Algorithmic Applications , 2017, SODA.

[21]  Tsvi Kopelowitz,et al.  Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap , 2016, ISAAC.

[22]  Vijaya Ramachandran,et al.  Fine-Grained Complexity and Conditional Hardness for Sparse Graphs , 2016, ArXiv.

[23]  Allan Grønlund Jørgensen,et al.  A Dichotomy for Regular Expression Membership Testing , 2016, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[24]  Richard Peng,et al.  Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs , 2016, STOC.

[25]  Timothy M. Chan,et al.  Polynomial Representations of Threshold Functions and Algorithmic Applications , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[26]  Christos Tzamos,et al.  Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms , 2016, ICML.

[27]  Krishnendu Chatterjee,et al.  Conditionally Optimal Algorithms for Generalized Büchi Games , 2016, MFCS.

[28]  Jakub W. Pachocki,et al.  Geometric median in nearly linear time , 2016, STOC.

[29]  Joshua R. Wang,et al.  Deterministic Time-Space Tradeoffs for k-SUM , 2016, ICALP.

[30]  Keren Censor-Hillel,et al.  Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks , 2016, DISC.

[31]  Amir Abboud,et al.  Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[32]  Kasper Green Larsen,et al.  Faster Online Matrix-Vector Multiplication , 2016, SODA.

[33]  Søren Dahlgaard,et al.  On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter , 2016, ICALP.

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

[35]  Richard Ryan Williams,et al.  Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation , 2016, CCC.

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

[37]  Roberto Grossi,et al.  New Bounds for Approximating Extremal Distances in Undirected Graphs , 2016, SODA.

[38]  Timothy M. Chan,et al.  Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky , 2016, SODA.

[39]  Joshua R. Wang,et al.  Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs , 2016, SODA.

[40]  Yi-Jun Chang,et al.  Hardness of RNA Folding Problem With Four Symbols , 2015, CPM.

[41]  Michal Pilipczuk,et al.  Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth , 2015, SODA.

[42]  Marvin Künnemann,et al.  Subquadratic Algorithms for Succinct Stable Matching , 2015, Algorithmica.

[43]  Amir Abboud,et al.  Subtree Isomorphism Revisited , 2015, SODA.

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

[45]  Huacheng Yu,et al.  Matching Triangles and Basing Hardness on an Extremely Popular Conjecture , 2015, STOC.

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

[47]  Huacheng Yu,et al.  An Improved Combinatorial Algorithm for Boolean Matrix Multiplication , 2015, ICALP.

[48]  Amir Abboud,et al.  If the Current Clique Algorithms are Optimal, So is Valiant's Parser , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[49]  Timothy M. Chan.  Speeding up the Four Russians Algorithm by About One More Logarithmic Factor , 2015, SODA.

[50]  Fabrizio Grandoni,et al.  Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter , 2015, SODA.

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

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

[53]  Yin Tat Lee,et al.  Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[54]  Joshua R. Wang,et al.  Space-Efficient Randomized Algorithms for K-SUM , 2014, ESA.

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

[56]  Tsvi Kopelowitz,et al.  Higher Lower Bounds from the 3SUM Conjecture , 2014, SODA.

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

[58]  Moshe Lewenstein,et al.  On Hardness of Jumbled Indexing , 2014, ICALP.

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

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

[61]  Robert E. Tarjan,et al.  Better Approximation Algorithms for the Graph Diameter , 2014, SODA.

[62]  Ryan Williams,et al.  Finding orthogonal vectors in discrete structures , 2014, SODA.

[63]  Aleksander Madry,et al.  Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[64]  Samuel R. Buss,et al.  Limits on Alternation Trading Proofs for Time–Space Lower Bounds , 2012, computational complexity.

[65]  Virginia Vassilevska Williams,et al.  Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.

[66]  Piotr Sankowski,et al.  Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[67]  François Le Gall,et al.  Faster Algorithms for Rectangular Matrix Multiplication , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[68]  Joseph M. Landsberg,et al.  The complexity of matrix multiplication , 2011 .

[69]  Liam Roditty,et al.  Minimum Weight Cycles and Triangles: Equivalences and Algorithms , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[70]  Richard Ryan Williams,et al.  Subcubic Equivalences between Path, Matrix and Triangle Problems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[71]  Shang-Hua Teng,et al.  Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.

[72]  Ashish Goel,et al.  Small subset queries and bloom filters using ternary associative memories, with applications , 2010, SIGMETRICS '10.

[73]  Parag Agrawal,et al.  On indexing error-tolerant set containment , 2010, SIGMOD Conference.

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

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

[76]  Nikhil Bansal,et al.  Regularity Lemmas and Combinatorial Algorithms , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[77]  Ryan Williams,et al.  Finding, minimizing, and counting weighted subgraphs , 2009, STOC '09.

[78]  Guy E. Blelloch,et al.  A New Combinatorial Approach for Sparse Graph Problems , 2008, ICALP.

[79]  Richard Ryan Williams,et al.  Time-Space Tradeoffs for Counting NP Solutions Modulo Integers , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[80]  Andrzej Lingas,et al.  Finding a heaviest triangle is not harder than matrix multiplication , 2007, SODA '07.

[81]  Ryan Williams,et al.  Matrix-vector multiplication in sub-quadratic time: (some preprocessing required) , 2007, SODA '07.

[82]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

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

[84]  Philip Bille,et al.  Fast and compact regular expression matching , 2005, Theor. Comput. Sci..

[85]  Erik D. Demaine,et al.  Subquadratic Algorithms for 3SUM , 2005, Algorithmica.

[86]  Seth Pettie,et al.  A Shortest Path Algorithm for Real-Weighted Undirected Graphs , 2005, SIAM J. Comput..

[87]  Boris Aronov,et al.  On approximating the depth and related problems , 2005, SODA '05.

[88]  Uri Zwick,et al.  On Dynamic Shortest Paths Problems , 2004, Algorithmica.

[89]  Seth Pettie,et al.  A new approach to all-pairs shortest paths on real-weighted graphs , 2004, Theor. Comput. Sci..

[90]  Shang-Hua Teng,et al.  Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.

[91]  Hector Garcia-Molina,et al.  Adaptive algorithms for set containment joins , 2003, TODS.

[92]  Mark H. Overmars,et al.  Preprocessing chains for fast dihedral rotations is hard or even impossible , 2002, Comput. Geom..

[93]  Lillian Lee,et al.  Fast context-free grammar parsing requires fast boolean matrix multiplication , 2001, JACM.

[94]  Rolf Klein,et al.  Smallest Color-Spanning Objects , 2001, ESA.

[95]  Sariel Har-Peled,et al.  Polygon-containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard , 2001, SODA '99.

[96]  Jeffrey F. Naughton,et al.  Set Containment Joins: The Good, The Bad and The Ugly , 2000, VLDB.

[97]  U. Schöning.  A probabilistic algorithm for k-SAT and constraint satisfaction problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[98]  Michael E. Saks,et al.  An improved exponential-time algorithm for k-SAT , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[99]  Don Coppersmith,et al.  Rectangular Matrix Multiplication Revisited , 1997, J. Complex..

[100]  S. Rajasekaran.  TAL Recognition in O(M(n2)) Time , 1995, ACL.

[101]  Jeff Erickson,et al.  Lower bounds for linear satisfiability problems , 1995, SODA '95.

[102]  Bernard Chazelle,et al.  Better lower bounds on detecting affine and spherical degeneracies , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[103]  Prosenjit Bose,et al.  Filling Polyhedral Molds , 1993, WADS.

[104]  Bernard Chazelle,et al.  Cutting hyperplanes for divide-and-conquer , 1993, Discret. Comput. Geom..

[105]  Ingo Schiermeyer,et al.  Solving 3-Satisfiability in Less Then 1, 579n Steps , 1992, CSL.

[106]  P. Boas.  Machine models and simulations , 1991 .

[107]  Ewald Speckenmeyer,et al.  Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..

[108]  M. Paterson,et al.  A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..

[109]  Michael L. Fredman,et al.  New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..

[110]  Michael J. Fischer,et al.  Boolean Matrix Multiplication and Transitive Closure , 1971, SWAT.

[111]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms (Working Paper) , 1971, SWAT.

[112]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[113]  Seth Pettie.  All Pairs Shortest Paths in Sparse Graphs , 2016, Encyclopedia of Algorithms.

[114]  Uri Zwick,et al.  Listing Triangles , 2014, ICALP.

[115]  Sariel Har-Peled,et al.  Finding a Guard that Sees Most and a Shop that Sells Most , 2007, Discrete & Computational Geometry.

[116]  David G. Kirkpatrick,et al.  Computing the Set of all the Distant Horizons of a Terrain , 2005, Int. J. Comput. Geom. Appl..

[117]  Steven Skiena,et al.  On Minimum-Area Hulls , 1998, Algorithmica.

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

[119]  Mark de Berg,et al.  Perfect Binary Space Partitions , 1993, Comput. Geom..

[120]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[121]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.