Skip to search formSkip to main contentSkip to account menu

Coppersmith–Winograd algorithm

Known as: Coppersmith-Winograd algorithm, Winograd 
In linear algebra, the Coppersmith–Winograd algorithm, named after Don Coppersmith and Shmuel Winograd, was the asymptotically fastest known matrix… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Balázs SzegedyCYK algorithmClaw-free graphClique problem

Broader (1)

Numerical linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor
In the past few years, successive improvements of the asymptotic complexity of square matrix multiplication have been obtained by… 
Highly Cited
2016
Highly Cited
2016
Faster CNNs with Direct Sparse Convolutions and Guided Pruning
Phenomenally successful in practical inference problems, convolutional neural networks (CNN) are widely deployed in mobile… 
Highly Cited
2014
Highly Cited
2014
Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method
Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time O… 
Review
2012
Review
2012
Relevance processes in multiple document comprehension
We introduce the MD-TRACE model (for Multiple-Document Task-based Relevance Assessment and Content Extraction), a descriptive… 
Highly Cited
2003
Highly Cited
2003
From computer to instrument system: a developmental perspective
Highly Cited
1999
Highly Cited
1999
Recursive array layouts and fast parallel matrix multiplication
Alvin R. Lebeckt Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial… 
Review
1993
Review
1993
Do categories have politics?
  • L. Suchman
  • Computer Supported Cooperative Work (CSCW)
  • 1993
  • Corpus ID: 17264160
Drawing on writings within the CSCW community and on recent social theory, this paper proposes that the adoption of speech act… 
Highly Cited
1991
Highly Cited
1991
The ALPHA language and its use for the design of systolic arrays
The ALPHA language results from research on automatic synthesis of systolic algorithms. It is based on the recurrence equation… 
Highly Cited
1985
Highly Cited
1985
On computing the discrete Hartley transform
The discrete Hartley transform (DHT) is a real-valued transform closely related to the DFT of a real-valued sequence. Bracewell… 
Highly Cited
1981
Highly Cited
1981
An in-place, in-order prime factor FFT algorithm
This paper presents a Fortran program that calculates the discrete Fourier transform using a prime factor algorithm. A very… 
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)