There is no English translation for this web page.
------ Links: ------
Link to publication 
Link to original publication 
Download Bibtex entry
|Title of Book||Seminaire Lotharingien de Combinatoire|
|Abstract||In 1969 Strassen discovered that Gaussian elimination is not an optimal algorithm for solving various problems in computational linear algebra. His result was based on a fast matrix multiplication algorithm needing only $O(ntau)$ arithmetic operations, where $tau < 2.81$. The infimum of all possible exponents $tau >= 2$ is called the exponent ω of matrix multiplication. By extending a method by Strassen, Coppersmith and Winograd showed in 1987 that $ømega < 2.38$. Today, one even conjectures that $ømega = 2$. We survey the main ideas and methods, which have led to such insights about the complexity of matrix multiplication. In particular, we sketch a simplified version of Coppersmith and Winograd's proof which is based on a nonconstructive existence proof for some combinatorial structure.|
Zusatzinformationen / Extras
Schnellnavigation zur Seite über Nummerneingabe
This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.
Copyright TU Berlin 2008