default search action
BibTeX record conf/stacs/Blaser01
@inproceedings{DBLP:conf/stacs/Blaser01, author = {Markus Bl{\"{a}}ser}, editor = {Afonso Ferreira and Horst Reichel}, title = {A (5/2)n\({}^{\mbox{2}}\)-Lower Bound for the Multiplicative Complexity of n{\texttimes}n-Matrix Multiplication}, booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2010}, pages = {99--109}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-44693-1\_9}, doi = {10.1007/3-540-44693-1\_9}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Blaser01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.