|
|
|
|
| LEADER |
01613 am a22002533u 4500 |
| 001 |
103636 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Devadas, Sheela
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Mathematics
|e contributor
|
| 100 |
1 |
0 |
|a Devadas, Srinivas
|e contributor
|
| 100 |
1 |
0 |
|a Rubinfeld, Ronitt
|e contributor
|
| 700 |
1 |
0 |
|a Rubinfeld, Ronitt
|e author
|
| 700 |
1 |
0 |
|a Devadas, Srinivas
|e author
|
| 245 |
0 |
0 |
|a A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness
|
| 260 |
|
|
|b Springer US,
|c 2016-07-15T22:56:51Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/103636
|
| 520 |
|
|
|a 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.
|
| 520 |
|
|
|a National Science Foundation (U.S.) (grants CCF-1217423, CCF-1065125, and CCF-1420692)
|
| 520 |
|
|
|a Israel Science Foundation (grant 1536/14)
|
| 546 |
|
|
|a en
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Theory of Computing Systems
|
