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.
2016
2016
Commonsense reasoning, commonsense knowledge, and the SP theory of intelligence
Commonsense reasoning (CSR) and commonsense knowledge (CSK) (together abbreviated as CSRK) are areas of study concerned with… 
Review
2006
Review
2006
The Design of Sites: Patterns for Creating Winning Web Sites (2nd Edition)
Praise for the second edition of The Design of Sites"In my worldwide IBM marketing role, I have the benefit of working with some… 
2000
2000
A Compact Architecture for Dialogue Management Based on Scripts and Meta-Outputs
We describe an architecture for spoken dialogue interfaces to semi-autonomous systems that transforms speech signals through… 
Review
2000
Review
2000
Designing and Evaluating Visualization Techniques for Construction Planning
Construction project teams view project information with traditional paper-based methods that have remained largely unchanged… 
Highly Cited
1993
Highly Cited
1993
A 2000 Rule Expert System Without Knowledge Engineers
A knowledge acquisition methodology, Ripple Down Rules, has been developed which only allows knowledge to be used in the context… 
Highly Cited
1989
Highly Cited
1989
A Family of New Efficient Arrays for Matrix Multiplication
The authors present a regular iterative algorithm for matrix multiplication and show that several well-known matrix… 
Review
1988
Review
1988
Using Natural Language Interfaces
1978
1978
A comparative study of time efficient FFT and WFTA programs for general purpose computers
Time efficient autogen software implementations of the fast Fourier transform (FFT) and the Winograd Fourier transform algorithm… 
1973
1973
An Efficient Robot Planner which Generates Its Own Procedures
LAWALY is a LISP program which solves robot planning problems. Given an axiomatic description of its capabilities in some world… 
Highly Cited
1970
Highly Cited
1970
On the Addition of Binary Numbers
An upper bound is derived for the time required to add numbers modulo 2n, using circuit elements with a limited fan-in and unit… 
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)