@InProceedings{bennett_et_al:LIPIcs.APPROX/RANDOM.2024.42,
author = {Bennett, Huck and Gajulapalli, Karthik and Golovnev, Alexander and Warton, Evelyn},
title = {{Matrix Multiplication Verification Using Coding Theory}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)},
pages = {42:1--42:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-348-5},
ISSN = {1868-8969},
year = {2024},
volume = {317},
editor = {Kumar, Amit and Ron-Zewi, Noga},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.42},
URN = {urn:nbn:de:0030-drops-210352},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2024.42},
annote = {Keywords: Matrix Multiplication Verification, Derandomization, Sparse Matrices, Error-Correcting Codes, Hardness Barriers, Reductions}
}