Bounds on sample space size for matrix product verification

We show that the size of any sample space that could be used in Freivalds' probabilistic matrix product verification algorithm for n × n matrices is at least ( n − 1)/ ε if the probability of error is at most ε, matching the upper bound of Kimbrel and Sinha. We also provide a characterization o...

Ausführliche Beschreibung