dc.contributor.author | Devadas, Sheela | |
dc.contributor.author | Rubinfeld, Ronitt | |
dc.contributor.author | Devadas, Srinivas | |
dc.date.accessioned | 2016-07-15T22:56:51Z | |
dc.date.available | 2016-07-15T22:56:51Z | |
dc.date.issued | 2015-06 | |
dc.identifier.issn | 1432-4350 | |
dc.identifier.issn | 1433-0490 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/103636 | |
dc.description.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. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (grants CCF-1217423, CCF-1065125, and CCF-1420692) | en_US |
dc.description.sponsorship | Israel Science Foundation (grant 1536/14) | en_US |
dc.publisher | Springer US | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1007/s00224-015-9639-z | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | Springer US | en_US |
dc.title | A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness | en_US |
dc.type | Article | en_US |
dc.identifier.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. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
dc.contributor.mitauthor | Devadas, Srinivas | en_US |
dc.contributor.mitauthor | Rubinfeld, Ronitt | en_US |
dc.relation.journal | Theory of Computing Systems | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dc.date.updated | 2016-06-30T12:07:28Z | |
dc.language.rfc3066 | en | |
dc.rights.holder | Springer Science+Business Media New York | |
dspace.orderedauthors | Devadas, Sheela; Rubinfeld, Ronitt | en_US |
dspace.embargo.terms | N | en |
dc.identifier.orcid | https://orcid.org/0000-0001-8253-7714 | |
dc.identifier.orcid | https://orcid.org/0000-0002-4353-7639 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |