Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,376,804 papers from all fields of science
Search
Sign In
Create Free Account
Strassen algorithm
Known as:
Strassen
, Strassen's algorithm
, Strassen's method
In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Binary logarithm
Boolean algebra
CPU cache
Cache-oblivious algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
On the arithmetic complexity of Strassen-like matrix multiplications
Murat Cenk
,
M. A. Hasan
Journal of symbolic computation
2017
Corpus ID: 11342148
2014
2014
Progress on the symmetric Strassen conjecture
E. Carlini
,
M. Catalisano
,
L. Chiantini
2014
Corpus ID: 62897531
Highly Cited
2006
Highly Cited
2006
Cache oblivious matrix multiplication using an element ordering based on the Peano curve
M. Bader
,
C. Zenger
2006
Corpus ID: 18119678
Highly Cited
2005
Highly Cited
2005
Vertical distribution of aerosol particles and NOx close to a motorway
D. Imhof
,
E. Weingartner
,
+9 authors
U. Baltensperger
2005
Corpus ID: 98807767
Highly Cited
2004
Highly Cited
2004
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
I. Kaporin
Theoretical Computer Science
2004
Corpus ID: 9046320
Highly Cited
1999
Highly Cited
1999
ON STRASSEN'S THEOREM ON STOCHASTIC DOMINATION
T. Lindvall
1999
Corpus ID: 3049351
The purpose of this note is to make available a reasonably complete and straightforward proof of Strassen's theorem on stochastic…
Expand
Highly Cited
1997
Highly Cited
1997
Multidimensional version of the results of Komlos, Major and Tusnady for vectors with finite exponential moments
A. Zaitsev
1997
Corpus ID: 36768263
A multidimensional version of the results of Komlos, Major and Tusnady for the Gaussian approximation of the sequence of…
Expand
Highly Cited
1994
Highly Cited
1994
Computation of high order derivatives in optimal shape design
Philippe Guillaume
,
M. Masmoudi
1994
Corpus ID: 15764992
Summary.In shape optimization problems, each computation of the cost function by the finite element method leads to an expensive…
Expand
Highly Cited
1977
Highly Cited
1977
Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2
Arnold Schönhage
Acta Informatica
1977
Corpus ID: 10244406
SummaryPolynomial multiplication of degree N can be accomplished in time O (N · log N) provided the scalar field contains…
Expand
1969
1969
A Note Concerning Behaviour of Iterated Logarithm Type
C. Heyde
1969
Corpus ID: 121559797
Let \(\{X_i, i=1, 2, 3, \ldots\}\) be a sequence of independent and identically distributed random variables and write \(S_n=\sum…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE