Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH

Shuichi Hirahara, Nobutaka Shimizu. Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 2346-2365, SIAM, 2022. [doi]

Abstract

Abstract is missing.