A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness
Author(s)Devadas, Sheela; Rubinfeld, Ronitt; Devadas, Srinivas
MetadataShow full item record
We present simple, self-contained proofs of correctness for algorithms for linearity testing and program checking of linear functions on finite subsets of integers represented as n-bit numbers. In addition we explore a generalization of self-testing to homomorphisms on a multidimensional vector space. We show that our self-testing algorithm for the univariate case can be directly generalized to vector space domains. The number of queries made by our algorithms is independent of domain size.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics
Theory of Computing Systems
Devadas, Sheela, and Ronitt Rubinfeld. “A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness.” Theory of Computing Systems 59.1 (2016): 99–111.
Author's final manuscript