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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In the past few years, successive improvements of the asymptotic complexity of square matrix multiplication have been obtained by… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
Is this relevant?
2015
2015
Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time O… (More)
  • table 1
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We develop an automated approach for designing matrix multiplication algorithms based on constructions similar to the Coppersmith… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Let α be the maximal value such that the product of an n × n<sup>α</sup> matrix by an n<sup>α</sup> × n matrix can be computed… (More)
  • table I
  • figure 1
  • figure 2
  • table II
Is this relevant?
2012
2012
We examine the task of resolving complex cases of definite pronouns, specifically those for which traditional linguistic… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2009
2009
We propose several new schedules for Strassen-Winograd's matrix multiplication algorithm, they reduce the extra memory allocation… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Researchers have explored the design of ambient information systems across a wide range of physical and screen-based media. This… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
system requirements between the developers and the ultimate customers of the system and to capture the inevitable changes in this… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The aim of this work is to introduce some notions of Commitment as a descriptive ontology crucial for the understanding of groups… (More)
Is this relevant?
Highly Cited
1974
Highly Cited
1974
The inherent computational complexity of a va r i e ty of decision problems i n mathematical logic and the theory of automata i s… (More)
  • table 4.2
Is this relevant?