Document Open Access Logo

Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems

Authors Bingbing Hu , Adam Polak

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2025.54.pdf
  • Filesize: 0.83 MB
  • 16 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Data structures design and analysis
  • Theory of computation → Complexity classes
Keywords
  • Fine-grained complexity
  • OMv hypothesis
  • reductions
  • equivalence class

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Most of the known tight lower bounds for dynamic problems are based on the Online Boolean Matrix-Vector Multiplication (OMv) Hypothesis, which is not as well studied and understood as some more popular hypotheses in fine-grained complexity. It would be desirable to base hardness of dynamic problems on a more believable hypothesis. We propose analogues of the OMv Hypothesis for variants of matrix multiplication that are known to be harder than Boolean product in the offline setting, namely: equality, dominance, min-witness, min-max, and bounded monotone min-plus products. These hypotheses are a priori weaker assumptions than the standard (Boolean) OMv Hypothesis and yet we show that they are actually equivalent to it. This establishes the first such fine-grained equivalence class for dynamic problems.

Cite As Get BibTex

Bingbing Hu and Adam Polak. Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 54:1-54:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.54

Author Details

Bingbing Hu
  • University of California San Diego, La Jolla, CA, USA
Adam Polak
  • Bocconi University, Milan, Italy

Funding

Part of this work was done when both authors were at Max Planck Institute for Informatics.

Acknowledgements

We thank anonymous reviewers for pointing us to the literature on the cell-probe model and for many useful hints on improving the manuscript.

References

  1. Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, and Raghu Meka. New graph decompositions and combinatorial boolean matrix multiplication algorithms. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, pages 935-943. ACM, 2024. URL: https://doi.org/10.1145/3618260.3649696.
  2. Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, and Renfei Zhou. More asymmetry yields faster matrix multiplication. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, pages 2005-2039. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978322.63.
  3. Michael A. Bender and Martin Farach-Colton. The LCA problem revisited. In LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, volume 1776 of Lecture Notes in Computer Science, pages 88-94. Springer, 2000. URL: https://doi.org/10.1007/10719839_9.
  4. Karl Bringmann, Allan Grønlund, Marvin Künnemann, and Kasper Green Larsen. The NFA acceptance hypothesis: Non-combinatorial and dynamic lower bounds. In 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, volume 287 of LIPIcs, pages 22:1-22:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.ITCS.2024.22.
  5. Timothy M. Chan, Virginia Vassilevska Williams, and Yinzhan Xu. Fredman’s trick meets dominance product: Fine-grained complexity of unweighted APSP, 3SUM counting, and more. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 419-432. ACM, 2023. URL: https://doi.org/10.1145/3564246.3585237.
  6. Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, and Yuancheng Yu. Nearly optimal separation between partially and fully retroactive data structures. In 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, volume 101 of LIPIcs, pages 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.SWAT.2018.33.
  7. Lijie Chen and Ryan Williams. An equivalence class for orthogonal vectors. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pages 21-40. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.2.
  8. Artur Czumaj, Miroslaw Kowaluk, and Andrzej Lingas. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theor. Comput. Sci., 380(1-2):37-46, 2007. URL: https://doi.org/10.1016/J.TCS.2007.02.053.
  9. Ran Duan and Seth Pettie. Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, pages 384-391. SIAM, 2009. URL: https://doi.org/10.1137/1.9781611973068.43.
  10. Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, and Yinzhan Xu. Faster monotone min-plus product, range mode, and single source replacement paths. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, volume 198 of LIPIcs, pages 75:1-75:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPICS.ICALP.2021.75.
  11. Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, pages 21-30. ACM, 2015. URL: https://doi.org/10.1145/2746539.2746609.
  12. Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, and Ely Porat. Closest pair problems in very high dimensions. In Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, volume 3142 of Lecture Notes in Computer Science, pages 782-792. Springer, 2004. URL: https://doi.org/10.1007/978-3-540-27836-8_66.
  13. Karim Labib, Przemyslaw Uznanski, and Daniel Wolleb-Graf. Hamming distance completeness. In 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, volume 128 of LIPIcs, pages 14:1-14:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.CPM.2019.14.
  14. Kasper Green Larsen and R. Ryan Williams. Faster online matrix-vector multiplication. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, pages 2182-2189. SIAM, 2017. URL: https://doi.org/10.1137/1.9781611974782.142.
  15. Andrea Lincoln, Adam Polak, and Virginia Vassilevska Williams. Monochromatic triangles, intermediate matrix products, and convolutions. In 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, volume 151 of LIPIcs, pages 53:1-53:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.ITCS.2020.53.
  16. Yang P. Liu. On approximate fully-dynamic matching and online matrix-vector multiplication. In 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, pages 228-243. IEEE, 2024. URL: https://doi.org/10.1109/FOCS61266.2024.00006.
  17. Jirí Matousek. Computing dominances in e^n. Inf. Process. Lett., 38(5):277-278, 1991. URL: https://doi.org/10.1016/0020-0190(91)90071-O.
  18. Kerui Min, Ming-Yang Kao, and Hong Zhu. The closest pair problem under the Hamming metric. In Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, volume 5609 of Lecture Notes in Computer Science, pages 205-214. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-02882-3_21.
  19. Mihai Pătraşcu. Towards polynomial lower bounds for dynamic problems. In Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pages 603-610. ACM, 2010. URL: https://doi.org/10.1145/1806689.1806772.
  20. Virginia Vassilevska. Efficient algorithms for path problems in weighted graphs. PhD thesis, Carnegie Mellon University, USA, 2008. Google Scholar
  21. Virginia Vassilevska, Ryan Williams, and Raphael Yuster. All pairs bottleneck paths and max-min matrix products in truly subcubic time. Theory Comput., 5(1):173-189, 2009. Announced at STOC 2007. URL: https://doi.org/10.4086/TOC.2009.V005A009.
  22. Virginia Vassilevska Williams. On some fine-grained questions in algorithms and complexity. In Proceedings of the International Congress of Mathematicians, ICM 2018, pages 3447-3487. World Scientific, 2018. URL: https://doi.org/10.1142/9789813272880_0188.
  23. Virginia Vassilevska Williams and R. Ryan Williams. Subcubic equivalences between path, matrix, and triangle problems. J. ACM, 65(5):27:1-27:38, 2018. Announced at FOCS 2010. URL: https://doi.org/10.1145/3186893.
  24. Virginia Vassilevska Williams and Yinzhan Xu. Monochromatic triangles, triangle listing and APSP. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, pages 786-797. IEEE, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00078.
  25. Virginia Vassilevska Williams and Yinzhan Xu. Truly subcubic min-plus product for less structured matrices, with applications. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, pages 12-29. SIAM, 2020. URL: https://doi.org/10.1137/1.9781611975994.2.
  26. R. Ryan Williams. Faster all-pairs shortest paths via circuit complexity. SIAM J. Comput., 47(5):1965-1985, 2018. Announced at STOC 2014. URL: https://doi.org/10.1137/15M1024524.
  27. Raphael Yuster and Uri Zwick. Fast sparse matrix multiplication. ACM Trans. Algorithms, 1(1):2-13, 2005. Announced at ESA 2004. URL: https://doi.org/10.1145/1077464.1077466.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact