New bounds for matrix multiplication: from alpha to omega
From MaRDI portal
Publication:6645500
DOI10.1137/1.9781611977912.134MaRDI QIDQ6645500
[[Person:6098008|Author name not available (Why is that?)]], Renfei Zhou, Yinzhan Xu, Virginia Vassilevska Williams
Publication date: 28 November 2024
Related Items (13)
Interpolation by decomposable univariate polynomials ⋮ Complex matrix inversion via real matrix inversions ⋮ Topological fingerprints for audio identification ⋮ Finding and counting small tournaments in large tournaments ⋮ Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths ⋮ Pivot Gray codes for the spanning trees of a graph ft. the fan ⋮ A refined laser method and faster matrix multiplication ⋮ Leanness computation: small values and special graph classes ⋮ Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication ⋮ The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds ⋮ Domination polynomials of the grid, the cylinder, the torus, and the king graph ⋮ Intersection of chordal graphs and some related partition problems ⋮ A new fast root-finder for black box polynomials
This page was built for publication: New bounds for matrix multiplication: from alpha to omega
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645500)
