R. Freivalds. Fast probabilistic Algorithms. Springer Verlag Lecture Notes in CS No.74, Mathematical Foundations of CS, pp. 57-69, 1979. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Testing Multivariate Linear Functions: Overcoming the Generator.. - Ergün (1994) (6 citations) (Correct)
....are simple, and each test makes only a constant number of calls to the program itself. Finally, we give a new self tester for matrix multiplication. It is already known that matrix multiplication can be tested with a constant number of calls to the program using a result checker due to Freivalds [Fre79], and a boostrap self tester for this p roblem is given in In all of our examples there are at least O(n) generators, where n is the degree of the polynomial where the input is a polynomial, or the size of the vector or the square matrix when the inputs are 1 vectors or matrices respectively. ....
R. Freivalds. Fast probabilistic Algorithms. Springer Verlag Lecture Notes in CS No.74, Mathematical Foundations of CS, pp. 57-69, 1979.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC