Image de couverture de livre

A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dumas, Jean-Guillaume, Pernet, Clément, Sedoglavic, Alexandre
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Symbolic Computation
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications
par: Dumas, Jean-Guillaume, et autres
Publié: (2025)

Towards automated generation of fast and accurate algorithms for recursive matrix multiplication
par: Dumas, Jean-Guillaume, et autres
Publié: (2025)

Strassen's algorithm is not optimally accurate
par: Dumas, Jean-Guillaume, et autres
Publié: (2024)

A data structure for monomial ideals with applications to signature Gröbner bases
par: Lairez, Pierre, et autres
Publié: (2026)

Adaptive Flip Graph Algorithm for Matrix Multiplication
par: Arai, Yamato, et autres
Publié: (2023)

Fast Matrix Multiplication via Ternary Meta Flip Graphs
par: Perminov, A. I.
Publié: (2025)

Exact Matching in Matrix Multiplication Time
par: Sato, Ryotaro, et autres
Publié: (2025)

Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
par: Kiefer, Stefan, et autres
Publié: (2025)

Parallel Two-Stage Approach for Joint Symbolic Approximation of Time Series
par: Chen, Xinye
Publié: (2023)

Dyadically resolving trinomials for fast modular arithmetic
par: Dougherty-Bliss, Robert, et autres
Publié: (2025)

Computing Krylov iterates in the time of matrix multiplication
par: Neiger, Vincent, et autres
Publié: (2024)

In-place accumulation of fast multiplication formulae
par: Dumas, Jean-Guillaume, et autres
Publié: (2023)

Super-Linear Speedup by Generalizing Runtime Repeated Recursion Unfolding in Prolog
par: Fruehwirth, Thom
Publié: (2025)

A more efficient algorithm to compute the Rand Index for change-point problems
par: Prates, Lucas de Oliveira
Publié: (2021)

Fast in-place accumulation
par: Dumas, Jean-Guillaume, et autres
Publié: (2023)

Algorithms for the local and the global postage stamp problem
par: Palais, Léo Colisson, et autres
Publié: (2026)

An algorithm for accurate and simple-looking metaphorical maps
par: Katsanou, Eleni, et autres
Publié: (2025)

Quasilinear-time eccentricities computation, and more, on median graphs
par: Bergé, Pierre, et autres
Publié: (2024)

Computational Explorations on Semifields
par: Dumas, Jean-Guillaume, et autres
Publié: (2026)

Fast and simple multiplication of bounded twin-width matrices
par: Kozma, László, et autres
Publié: (2026)

A new notion of commutativity for the algorithmic Lovász Local Lemma
par: Harris, David G., et autres
Publié: (2020)

Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search
par: Khoruzhii, Kirill, et autres
Publié: (2025)

Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more
par: Karczmarz, Adam, et autres
Publié: (2024)

Induced Minor Models. II. Sufficient conditions for polynomial-time detection of induced minors
par: Dallard, Clément, et autres
Publié: (2024)

Efficient distributional regression trees learning algorithms for calibrated non-parametric probabilistic forecasts
par: Duchemin, Quentin, et autres
Publié: (2025)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs
par: Dumas, Maël, et autres
Publié: (2022)

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
par: Fischer, David, et autres
Publié: (2022)

On approximability of the Permanent of PSD matrices
par: Ebrahimnejad, Farzam, et autres
Publié: (2024)

An Objective Improvement Approach to Solving Discounted Payoff Games
par: Dell'Erba, Daniele, et autres
Publié: (2024)

Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
par: Berthe, Gaétan, et autres
Publié: (2023)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
par: Ducoffe, Guillaume
Publié: (2026)

Optimal Secure Coded Distributed Computation over all Fields
par: Soto, Pedro
Publié: (2025)

Optimal bounds on a tree inference algorithm
par: Gardiner, Jack, et autres
Publié: (2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
par: Bhore, Sujoy, et autres
Publié: (2024)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
par: Chalopin, Jérémie, et autres
Publié: (2025)

On the uniqueness and computation of commuting extensions
par: Koiran, Pascal
Publié: (2024)

A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
par: Elkin, Yury, et autres
Publié: (2021)

Simple approximation algorithms for Polyamorous Scheduling
par: Biktairov, Yuriy, et autres
Publié: (2024)

Fast multiplication of random dense matrices with fixed sparse matrices
par: Liang, Tianyu, et autres
Publié: (2023)

Dynamic data structures for twin-ordered matrices
par: Bosek, Bartłomiej, et autres
Publié: (2026)