Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Adaptive Winograd's matrix multiplications

From MaRDI portal
Publication:2989058
Jump to:navigation, search

DOI10.1145/1486525.1486528zbMath1364.65094OpenAlexW2144868850WikidataQ113310559 ScholiaQ113310559MaRDI QIDQ2989058

Alexandru Nicolau, Paolo D'Alberto

Publication date: 19 May 2017

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1486525.1486528


zbMATH Keywords

fast algorithmsWinograd's matrix multiplications


Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical algorithms for specific classes of architectures (65Y10)


Related Items (3)

Faster All-Pairs Shortest Paths via Circuit Complexity ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ From Circuit Complexity to Faster All-Pairs Shortest Paths


Uses Software

  • ATLAS
  • FLAME
  • SPIRAL
  • GEMMW
  • FFTW
  • PHiPAC
  • Algorithm 679
  • GotoBLAS
  • Algorithm 784






This page was built for publication: Adaptive Winograd's matrix multiplications

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2989058&oldid=15999588"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki