A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness
Name
224_2015_9639_ReferencePDF.pdf
Size
178.73 KB
Format
Adobe PDF
Checksum (MD5)
c940583c175d48f0e7d33f78cd0f05c4
Author(s)
Devadas, Sheela
Rubinfeld, Ronitt
Devadas, Srinivas
Date Issued
June 2015
Journal
Theory of Computing Systems
Publisher
Springer US
Citation
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.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts 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
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00224-015-9639-z
