Cover Image

Matrix Multiplication Verification Using Coding Theory

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bennett, Huck, Gajulapalli, Karthik, Golovnev, Alexander, Warton, Evelyn
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Output-Sparse Matrix Multiplication Using Compressed Sensing
by: Bennett, Huck, et al.
Published: (2025)

Online Orthogonal Vectors Revisited
by: Gajulapalli, Karthik, et al.
Published: (2026)

Graph Inference with Effective Resistance Queries
by: Bennett, Huck, et al.
Published: (2025)

Improved Time-Space Tradeoffs for 3SUM-Indexing
by: Dinur, Itai, et al.
Published: (2025)

Downward self-reducibility in the total function polynomial hierarchy
by: Gajulapalli, Karthik, et al.
Published: (2025)

Matrix Multiplication Reductions
by: Gola, Ashish, et al.
Published: (2024)

Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
by: Bentert, Matthias, et al.
Published: (2024)

Improved Sparse Recovery for Approximate Matrix Multiplication
by: Uffenheimer, Yahel, et al.
Published: (2026)

Optimal Approximate Matrix Multiplication over Sliding Window
by: Xian, Haoming, et al.
Published: (2025)

Composition Orderings for Linear Functions and Matrix Multiplication Orderings
by: Kubo, Susumu, et al.
Published: (2024)

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation
by: Schwartz, Oded, et al.
Published: (2025)

Data Structures Meet Cryptography: 3SUM with Preprocessing
by: Golovnev, Alexander, et al.
Published: (2019)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
by: Abboud, Amir, et al.
Published: (2023)

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
by: Gawrychowski, Paweł, et al.
Published: (2024)

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
by: Liu, Yang P.
Published: (2024)

Improved Hardness of BDD and SVP Under Gap-(S)ETH
by: Bennett, Huck, et al.
Published: (2021)

Linear Space Streaming Lower Bounds for Approximating CSPs
by: Chou, Chi-Ning, et al.
Published: (2021)

An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS
by: Koo, Jaehyun
Published: (2024)

Fine-Grained Computation in 3-Space: Matrix Multiplication and Graph Problems
by: Stout, Quentin F.
Published: (2024)

A 58-Addition, Rank-23 Scheme for General 3x3 Matrix Multiplication
by: Perminov, A. I.
Published: (2025)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
by: Assadi, Sepehr, et al.
Published: (2025)

(Approximate) Matrix Multiplication via Convolutions
by: Uffenheimer, Yahel, et al.
Published: (2025)

Masked Matrix Multiplication for Emergent Sparsity
by: Wheatman, Brian, et al.
Published: (2024)

Range Longest Increasing Subsequence and its Relatives
by: S., Karthik C., et al.
Published: (2024)

Adaptive Flip Graph Algorithm for Matrix Multiplication
by: Arai, Yamato, et al.
Published: (2023)

More Asymmetry Yields Faster Matrix Multiplication
by: Alman, Josh, et al.
Published: (2024)

Optimal Approximate Matrix Multiplication over Sliding Windows
by: Yao, Ziqi, et al.
Published: (2025)

Fast Matrix Multiplication via Ternary Meta Flip Graphs
by: Perminov, A. I.
Published: (2025)

Packing Entries to Diagonals for Homomorphic Sparse-Matrix Vector Multiplication
by: Mutluergil, Kemal, et al.
Published: (2026)

Designing Compact ILPs via Fast Witness Verification
by: Włodarczyk, Michał
Published: (2025)

Log Diameter Rounds MST Verification and Sensitivity in MPC
by: Coy, Sam, et al.
Published: (2024)

Exact Matching in Matrix Multiplication Time
by: Sato, Ryotaro, et al.
Published: (2025)

Revisiting the Sparse Matrix Compression Problem
by: Jugé, Vincent, et al.
Published: (2026)

Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid
by: Diwan, Haya, et al.
Published: (2025)

Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions
by: Indyk, Piotr, et al.
Published: (2025)

A Simple Sparse Matrix Vector Multiplication Approach to Padded Convolution
by: Chaudhry, Zan
Published: (2024)

New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification
by: Ghosh, Prantar, et al.
Published: (2024)

Complexity of Perfect and Ideal Resilience Verification in Fast Re-Route Networks
by: Bentert, Matthias, et al.
Published: (2026)

Fast exact algorithms via the Matrix Tree Theorem
by: Arvind, V., et al.
Published: (2025)

Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms
by: Uotila, Valter
Published: (2024)