Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,232,158 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.
2011
2011
An invariance principle for the law of the iterated logarithm for some Markov chains
Bolt Witold
,
Majewski Adam Aleksander
,
S. Tomasz
2011
Corpus ID: 119178058
The Strassen's invariance principle for additive functionals of Markov chains with spectral gap in the Wasserstein metric is…
Expand
Review
2008
Review
2008
Multithreading and Strassen’s algorithms in SUNRED field solver
L. Pohl
14th International Workshop on Thermal…
2008
Corpus ID: 41650117
Complex structures can be well modeled by simulation using appropriate field solvers; however the investigation of detailed…
Expand
2005
2005
A Complete Characterization of the Algebras of Minimal Bilinear Complexity
M. Bläser
SIAM journal on computing (Print)
2005
Corpus ID: 29355467
Let R(A) denote the rank (also called bilinear complexity) of a finite dimensional associative algebra A. A fundamental lower…
Expand
2003
2003
Machbarkeitsstudie zur Formulierung von Anforderungen fuer ein neues Umweltzeichen fuer Enteisungsmittel fuer Strassen und Wege, in Anlehnung an DIN EN ISO 14024 - Forschungsbericht 200 95 308/04…
S. Gartiser
,
R. Reuther
,
C. Gensch
2003
Corpus ID: 170577255
Im Rahmen der Machbarkeitsstudie in Anlehnung an DIN EN ISO 14024 sollte ueberprueft werden, ob die Vergabe eines Umweltzeichens…
Expand
1999
1999
Forward-backward martingale decomposition and compactness results for additive functionals of stationary ergodic Markov processes
Liming Wu
,
Liming Wu
1999
Corpus ID: 53356515
1998
1998
Bulk-Synchronous Parallel Multiplication of Boolean Matrices
A. Tiskin
International Colloquium on Automata, Languages…
1998
Corpus ID: 30893714
We correct an error in the analysis of local computation cost of a bulk-synchronous parallel algorithm for Boolean matrix…
Expand
1991
1991
Statistical complexity of dominant eigenvector calculation
E. Kostlan
Journal of Complexity
1991
Corpus ID: 17432688
Highly Cited
1980
Highly Cited
1980
The foraging system ofPheidole militicida (Hymenoptera: Formicidae)
B. Hölldobler
,
M. Möglich
Insectes Sociaux
1980
Corpus ID: 41313495
Summary1-Foragers of the harvester antPheidole militicida travel along well defined trunk trails to their foraging grounds. These…
Expand
1975
1975
On the Complexity of Quaternion Multiplication
H. F. D. Groote
Information Processing Letters
1975
Corpus ID: 204995879
1970
1970
Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
R. Brent
1970
Corpus ID: 14091907
SummaryThe number of multiplications required for matrix multiplication, for the triangular decomposition of a matrix with…
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