Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism

SODA '18: Symposium on Discrete Algorithms New Orleans Louisiana January, 2018, pp. 1-33, 2019.

Cited by: 13|Bibtex|Views22|Links
EI
Keywords:
Boolean functionsProperty testingfunction isomorphismjuntassubmodular optimizationMore(1+)

Abstract:

A function f:{ −1,1}n → { −1,1} is a k-junta if it depends on at most k of its variables. We consider the problem of tolerant testing of k-juntas, where the testing algorithm must accept any function that is ε-close to some k-junta and reject any function that is ε′-far from every k′-junta for some ε′ = O(ε) and k′ = O(k). Our first resu...More

Code:

Data:

Your rating :
0

 

Tags
Comments