Shuichi Hirahara, Nobutaka Shimizu. Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. pages 2346-2365, SIAM, 2021. [doi]
@inproceedings{HiraharaS21,
title = {Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH},
author = {Shuichi Hirahara and Nobutaka Shimizu},
year = {2021},
doi = {10.1137/1.9781611976465.140},
url = {https://doi.org/10.1137/1.9781611976465.140},
researchr = {https://researchr.org/publication/HiraharaS21},
cites = {0},
citedby = {0},
pages = {2346-2365},
booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021},
editor = {Dániel Marx},
publisher = {SIAM},
isbn = {978-1-61197-646-5},
}