A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication

Details A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication

2009-12-19

arxiv.org/abs/0912.3925v2

Computer Science

Data Structures and Algorithms

Scientific paper

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 $Theta(n^2)$ 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.

Affiliated with

Also associated with

No associations

Rating

A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-382139