Matching triangles and basing hardness on an extremely popular conjecture

DOI10.1145/2746539.2746594MaRDI QIDQ2941487zbMATH OpenOpenAlexFDO

Authors Amir Abboud, Huacheng Yu, Virginia Vassilevska Williams

Publication date 21 August 2015

Published in Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2746539.2746594

zbMATH Keywords

3SUMreductionsdynamic data structuresconditional lower boundsAPSPsethCNF-SATsingle-source max-flow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Flows in graphs (05C21)

Recommendations

• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
• Higher lower bounds from the 3SUM conjecture
• Towards polynomial lower bounds for dynamic problems
• Threesomes, degenerates, and love triangles
• Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture

Cites work

• Approximate distance oracles
• Approximate distance oracles with constant query time
• Automata, Languages and Programming
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Fast C-K-R partitions of sparse graphs
• Near-Linear Time Construction of Sparse Neighborhood Covers
• On approximate distance labels and routing schemes with affine stretch
• On sparse spanners of weighted graphs
• Ramsey partitions and proximity data structures
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• Shortest-path queries in static networks

Cited in

(20)

• A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs
• scientific article; zbMATH DE number 7378707 (Why is no real title available?)
• On sequential functions and fine-grained cryptography
• Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
• On adaptive algorithms for maximum matching
• Towards polynomial lower bounds for dynamic problems
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
• Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
• scientific article; zbMATH DE number 7250154 (Why is no real title available?)
• Nearly optimal separation between partially and fully retroactive data structures
• Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
• Fine-Grained Complexity Theory (Tutorial)
• Fooling views: a new lower bound technique for distributed computations under congestion
• Conditional hardness for sensitivity problems
• Higher lower bounds from the 3SUM conjecture
• Improved bounds for 3SUM, \(k\)-SUM, and linear degeneracy
• scientific article; zbMATH DE number 7559154 (Why is no real title available?)
• Towards hardness of approximation for polynomial time problems
• Tighter connections between Formula-SAT and shaving logs
• Subquadratic algorithms for algebraic 3SUM

Describes a project that uses

Uses Software

• Graphs

This page was built for publication: Matching triangles and basing hardness on an extremely popular conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941487)