A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness

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 spa...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theory of computing systems Ročník 59; číslo 1; s. 99 - 111
Hlavní autoři: Devadas, Sheela, Rubinfeld, Ronitt
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.07.2016
Springer Nature B.V
Témata:
Algorithms
Computer Science
Homomorphisms
Integer programming
Integers
Mathematical analysis
Mathematical models
Proving
Queries
Studies
Theory of Computation
Vector space
Vector spaces
Linearity testing
Property testing
ISSN:1432-4350, 1433-0490
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-015-9639-z