Matrix Multiply Checker AB = C takes at least these much time. we want matrix product checker that checks if mutiplication is correct in O(n2). we choose vector r randomly that has only 1 or 0. and we compute A(Br) = (Cr) if it is same than we say it's true otherwise false. this computation takes O(n2) because (n*n) * (n*n) * (n*1) == n^2 , (n*n) * (n*1) == n we want to show that there are many ..
