Cover Image

Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Andersson, Joel, Karppa, Matti
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms F.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Selective algorithm processing of subset sum distributions
by: Dawes, Nick
Published: (2024)

An O(nlogn) approximate knapsack algorithm
by: Dawes, Nick
Published: (2025)

Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
by: Li, Yifei
Published: (2024)

The Simultaneous Triple Product Property and Group-theoretic Results for the Exponent of Matrix Multiplication
by: Murthy, Sandeep
Published: (2007)

Beating Meet-in-the-Middle for Subset Balancing Problems
by: Randolph, Tim, et al.
Published: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
by: Randolph, Tim, et al.
Published: (2024)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
by: Gillman, David, et al.
Published: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
by: Bläsius, Thomas, et al.
Published: (2024)

The Structural Complexity of Matrix-Vector Multiplication
by: Anand, Emile, et al.
Published: (2025)

Min-CSPs on Complete Instances
by: Anand, Aditya, et al.
Published: (2024)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
by: Bushnell, Brian
Published: (2026)

Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search
by: Khoruzhii, Kirill, et al.
Published: (2025)

A Heuristic for Direct Product Graph Decomposition
by: Calderoni, Luca, et al.
Published: (2021)

Stable Iterative Solvers for Ill-conditioned Linear Systems
by: Kalantzis, Vasileios, et al.
Published: (2025)

Deterministic complexity analysis of Hermitian eigenproblems
by: Sobczyk, Aleksandros
Published: (2024)

Invariant subspaces and PCA in nearly matrix multiplication time
by: Sobczyk, Aleksandros, et al.
Published: (2023)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
by: Bhattacharjee, Rajarshi, et al.
Published: (2023)

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)

Unsplittable Multicommodity Flows in Outerplanar Graphs
by: Alemán-Espinosa, David, et al.
Published: (2025)

Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
by: Shao, Xuancheng, et al.
Published: (2007)

Smoothed Analysis of Interior-Point Algorithms: Condition Number
by: Dunagan, John, et al.
Published: (2003)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
by: Spielman, Daniel A., et al.
Published: (2003)

Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
by: Spielman, Daniel A., et al.
Published: (2006)

Efficient Uniform Sampling of Surjections via their Profiles
by: Carayol, Arnaud, et al.
Published: (2026)

Generating Signed Permutations by Twisting Two-Sided Ribbons
by: Yuan, et al.
Published: (2023)

Matrix-by-matrix multiplication algorithm with $O(N^2log_2N)$ computational complexity for variable precision arithmetic
by: Paszyński, Maciej
Published: (2024)

Reserve Matching with Thresholds
by: Evren, Suat
Published: (2023)

Entrywise Approximate Solutions for SDDM Systems in Almost-Linear Time
by: Farfan, Angelo, et al.
Published: (2025)

A 60-Addition, Rank-23 Scheme for Exact 3x3 Matrix Multiplication
by: Stapleton, Joshua
Published: (2025)

Eliminating Illusion in Directed Networks
by: Jana, Sougata, et al.
Published: (2026)

Restless reachability problems in temporal graphs
by: Thejaswi, Suhas, et al.
Published: (2020)

Model-Based Learning of Whittle indices
by: Charles-Rebuffé, Joël, et al.
Published: (2025)

An 8- and 12-bit block AES cipher
by: Breuer, Peter T.
Published: (2025)

Faster Multi-Source Directed Reachability via Shortcuts and Matrix Multiplication
by: Elkin, Michael, et al.
Published: (2024)

Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores
by: Garg, Ishant
Published: (2026)

Tensor Decomposition for Non-Clifford Gate Minimization
by: Khoruzhii, Kirill, et al.
Published: (2026)

Does block size matter in randomized block Krylov low-rank approximation?
by: Chen, Tyler, et al.
Published: (2025)

Fast Order Statistics with Group Inequality Testing
by: Liyanage, Adiesha, et al.
Published: (2025)

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs
by: Künnemann, Marvin, et al.
Published: (2024)

On the Computation of 2-Dimensional Recurrence Equations
by: Natale, Giuseppe
Published: (2024)