Go to the corresponding LIPIcs Volume Portal 
Das, Debarati ; Koucký, Michal ; Saks, Michael
pdfformat: 

@InProceedings{das_et_al:LIPIcs:2018:8505, author = {Debarati Das and Michal Kouck{\'y} and Michael Saks}, title = {{Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication}}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, pages = {23:123:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770620}, ISSN = {18688969}, year = {2018}, volume = {96}, editor = {Rolf Niedermeier and Brigitte Vall{\'e}e}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8505}, URN = {urn:nbn:de:0030drops85050}, doi = {10.4230/LIPIcs.STACS.2018.23}, annote = {Keywords: Lower bounds, Combinatorial algorithm, Boolean matrix multiplication} }
Keywords:  Lower bounds, Combinatorial algorithm, Boolean matrix multiplication  
Seminar:  35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)  
Issue Date:  2018  
Date of publication:  20.02.2018 