@InProceedings{das_et_al:LIPIcs.STACS.2018.23,
author = {Das, Debarati and Kouck\'{y}, Michal and Saks, Michael},
title = {{Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {23:1--23:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.23},
URN = {urn:nbn:de:0030-drops-85050},
doi = {10.4230/LIPIcs.STACS.2018.23},
annote = {Keywords: Lower bounds, Combinatorial algorithm, Boolean matrix multiplication}
}