@InProceedings{haviv_et_al:LIPIcs.MFCS.2022.56,
author = {Haviv, Ishay and Parnas, Michal},
title = {{On the Binary and Boolean Rank of Regular Matrices}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {56:1--56:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-256-3},
ISSN = {1868-8969},
year = {2022},
volume = {241},
editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.56},
URN = {urn:nbn:de:0030-drops-168545},
doi = {10.4230/LIPIcs.MFCS.2022.56},
annote = {Keywords: Binary rank, Boolean rank, Regular matrices, Non-deterministic communication complexity, Biclique partition number, Chromatic number}
}