A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication
Data Structures and Algorithms
2010-03-17 v2 Discrete Mathematics
Abstract
Fingerprinting is a well known technique, which is often used in designing Monte Carlo algorithms for verifying identities involving ma- trices, integers and polynomials. The book by Motwani and Raghavan [1] shows how this technique can be applied to check the correctness of matrix multiplication -- check if AB = C where A, B and C are three nxn matrices. The result is a Monte Carlo algorithm running in time with an exponentially decreasing error probability after each indepen- dent iteration. In this paper we give a simple alternate proof addressing the same problem. We also give further generalizations and relax various assumptions made in the proof.
Keywords
Cite
@article{arxiv.0912.3925,
title = {A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication},
author = {Vamsi K. Kundeti},
journal= {arXiv preprint arXiv:0912.3925},
year = {2010}
}