Skip to main navigation Skip to search Skip to main content

Reducing testing affine spaces to testing linearity of functions

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

For any finite field F and k<ℓ, we consider the task of testing whether a function f:F→{0,1} is the indicator function of an (ℓ-k)-dimensional affine space. For the case of F=GF(2), an optimal tester for this property was presented by Parnas, Ron, and Samorodnitsky (SIDMA 2002), by mimicking the celebrated linearity tester of Blum, Luby and Rubinfeld (JCSS 1993) and its analysis. We show that the former task (i.e., testing (ℓ-k)-dimensional affine spaces) can be efficiently reduced to testing the linearity of a related function g:F→Fk. This reduction yields an almost optimal tester for affine spaces (represented by their indicator function). Recalling that Parnas, Ron, and Samorodnitsky used testing (ℓ-k)-dimensional affine spaces as the first step in a two-step procedure for testing k-monomials, we also show that the second step in their procedure can be reduced to testing whether the foregoing function g depends on k of its variables.

Original languageEnglish GB
Title of host publicationComputational Complexity and Property Testing
Subtitle of host publicationOn the Interplay Between Randomness and Computation
EditorsOded Goldreich
PublisherSpringer Verlag
Chapter13
Pages199-219
Number of pages21
DOIs
StatePublished Online - 4 Apr 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12050 LNCS

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Reducing testing affine spaces to testing linearity of functions'. Together they form a unique fingerprint.

Cite this