Discovering faster matrix multiplication algorithms with reinforcement learning
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1476-4687
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Discovering faster matrix multiplication algorithms with reinforcement learning ; volume:610 ; number:7930 ; day:5 ; month:10 ; year:2022 ; pages:47-53 ; date:10.2022
Nature; 610, Heft 7930 (5.10.2022), 47-53, 10.2022
- Urheber
-
Fawzi, Alhussein
Balog, Matej
Huang, Aja
Hubert, Thomas
Romera-Paredes, Bernardino
Barekatain, Mohammadamin
Novikov, Alexander
R. Ruiz, Francisco J.
Schrittwieser, Julian
Swirszcz, Grzegorz
Silver, David
Hassabis, Demis
Kohli, Pushmeet
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1038/s41586-022-05172-4
- URN
-
urn:nbn:de:101:1-2022122221025101613672
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:31 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Fawzi, Alhussein
- Balog, Matej
- Huang, Aja
- Hubert, Thomas
- Romera-Paredes, Bernardino
- Barekatain, Mohammadamin
- Novikov, Alexander
- R. Ruiz, Francisco J.
- Schrittwieser, Julian
- Swirszcz, Grzegorz
- Silver, David
- Hassabis, Demis
- Kohli, Pushmeet
- SpringerLink (Online service)
Ähnliche Objekte (12)
Faster Montgomery multiplication and Multi-Scalar-Multiplication for SNARKs
A Refined Laser Method and Faster Matrix Multiplication
Algorithms for the Multiplication Table Problem
Faster Algorithms for Sparse Fourier Transform
Multi-agent reinforcement learning algorithms
Multi-agent reinforcement learning algorithms
Faster algorithms for k-subset sum and variations
Faster algorithms for counting subgraphs in sparse graphs
Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
Faster horn diagnosis - a performance comparison of abductive reasoning algorithms
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
Faster parameterized algorithms for modification problems to minor-closed classes
Faster Montgomery multiplication and Multi-Scalar-Multiplication for SNARKs
A Refined Laser Method and Faster Matrix Multiplication
Algorithms for the Multiplication Table Problem
Faster Algorithms for Sparse Fourier Transform
Multi-agent reinforcement learning algorithms
Multi-agent reinforcement learning algorithms
Faster algorithms for k-subset sum and variations
Faster algorithms for counting subgraphs in sparse graphs
Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
Faster horn diagnosis - a performance comparison of abductive reasoning algorithms
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
Faster parameterized algorithms for modification problems to minor-closed classes
Faster Montgomery multiplication and Multi-Scalar-Multiplication for SNARKs
A Refined Laser Method and Faster Matrix Multiplication
Algorithms for the Multiplication Table Problem
Faster Algorithms for Sparse Fourier Transform
Multi-agent reinforcement learning algorithms
Multi-agent reinforcement learning algorithms
Faster algorithms for k-subset sum and variations
Faster algorithms for counting subgraphs in sparse graphs
Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
Faster horn diagnosis - a performance comparison of abductive reasoning algorithms
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems