Coppersmith–Winograd algorithm

E1798755 UNEXPLORED

The Coppersmith–Winograd algorithm is a highly influential fast matrix multiplication algorithm that achieved a record low asymptotic time complexity and underpins many advances in theoretical computer science.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Coppersmith–Winograd algorithm canonical	2

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

Shmuel Winograd → knownFor → Coppersmith–Winograd algorithm ⓘ

Shmuel Winograd → coDeveloped → Coppersmith–Winograd algorithm ⓘ