The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems
Abstract
We consider several well-studied problems in dynamic algorithms and prove that sufficient progress on any of them would imply a breakthrough on one of five major open problems in the theory of algorithms: 1) Is the 3SUM problem on n numbers in O(n2-ε) time for some ε > 0? 2) Can one determine the satisfiability of a CNF formula on n variables and poly n clauses in O((2 - ε)npoly n) time for some ε > 0? 3) Is the All Pairs Shortest Paths problem for graphs on n vertices in O(n3-ε) time for some ε > 0? 4) Is there a linear time algorithm that detects whether a given graph contains a triangle? 5) Is there an O(n3-ε) time combinatorial algorithm for n×n Boolean matrix multiplication? The problems we consider include dynamic versions of bipartite perfect matching, bipartite maximum weight matching, single source reachability, single source shortest paths, strong connectivity, subgraph connectivity, diameter approximation and some nongraph problems such as Pagh's problem defined in a recent paper by Patrascu[STOC 2010].
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Cabano, F. G., Müller, S., & Gelbrich, K. (2024) · Interfaith Marketing · doi:10.4324/9781003506010-51 · Cited by 1,464
Impagliazzo, R., & Paturi, R. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1727 · Cited by 1,002
Powers of tensors and fast matrix multiplication
Le Gall, F. (2014) · Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2608628.2608664 · Cited by 856
Multiplying matrices faster than coppersmith-winograd
Williams, V. V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214056 · Cited by 850
Self-citationFinding and counting given length cycles
Alon, N., Yuster, R., & Zwick, U. (1997) · Algorithmica · doi:10.1007/bf02523189 · Cited by 608
A probabilistic algorithm for k-SAT and constraint satisfaction problems
Schoning, T. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814612 · Cited by 433
Finding a Minimum Circuit in a Graph
Itai, A., & Rodeh, M. (1978) · SIAM Journal on Computing · doi:10.1137/0207033 · Cited by 391
A new algorithm for optimal 2-constraint satisfaction and its implications
Williams, R. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.09.023 · Cited by 386
Subcubic Equivalences between Path, Matrix and Triangle Problems
Williams, V. V., & Williams, R. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.67 · Cited by 240
Self-citationAn improved exponential-time algorithm for k -SAT
Paturi, R., Pudlák, P., Saks, M. E., & Zane, F. (2005) · Journal of the ACM · doi:10.1145/1066100.1066101 · Cited by 209
Towards polynomial lower bounds for dynamic problems
Patrascu, M. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806772 · Cited by 207
Algebraic complexity theory and matrix multiplication
Le Gall, F. (2014) · Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2608628.2627493 · Cited by 193
Faster all-pairs shortest paths via circuit complexity
Williams, R. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591811 · Cited by 167
On the possibility of faster SAT algorithms
Pǎtraşcu, M., & Williams, R. (2010) · Cited by 164
Improved bound for complexity of matrix multiplication
Davie, A. M., & Stothers, A. J. (2013) · Proceedings of the Royal Society of Edinburgh: Section A Mathematics · doi:10.1017/s0308210511001648 · Cited by 152
On Dynamic Shortest Paths Problems
Roditty, L., & Zwick, U. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30140-0_52 · Cited by 103
A New Algorithm for Optimal Constraint Satisfaction and Its Implications
Williams, R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27836-8_101 · Cited by 95
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier
Demetrescu, C., & Italiano, G. F. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892126 · Cited by 89
On the possibility of faster SAT algorithms
Pǎtraşcu, M., & Williams, R. (2010) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973075.86 · Cited by 87
Space and Time Complexity of Exact Algorithms: Some Open Problems
Woeginger, G. J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28639-4_25 · Cited by 83
Regularity Lemmas and Combinatorial Algorithms
Bansal, N., & Williams, R. (2009) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.76 · Cited by 54
Powers of Tensors and Fast Matrix MultiplicationPreprint
Gall, F. L. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.7714 · Cited by 47
Dynamic Subgraph Connectivity with Geometric Applications
Chan, T. M. (2006) · SIAM Journal on Computing · doi:10.1137/s009753970343912x · Cited by 30
Metadata
- Authors
- Abboud, A., & Williams, V. V.
- Venue
- 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 2014-10
- Pages
- 434-443
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2146507303
- Cited by
- 268
- References
- 24
- FWCI
- 19.50
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.