Quantum Algorithms for Learning and Testing Juntas
Quantum Information Processing
Parameterized Learnability of k-Juntas and Related Problems
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Improved Bounds for Testing Juntas
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Parameterized learnability of juntas
Theoretical Computer Science
Application of a generalization of russo's formula to learning from multiple random oracles
Combinatorics, Probability and Computing
Testing juntas: a brief survey
Property testing
Testing juntas: a brief survey
Property testing
Communication complexities of symmetric XOR functions
Quantum Information & Computation
A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions
Quantum Information & Computation
| Hi-index | 0.00 |
We study the following question: What is the smallest t such that every symmetric boolean function on k variables (which is not a constant or a parity function), has a non-zero Fourier coefficient of order at least 1 and at most t? We exclude the constant functions for which there is no such t and the parity functions for which t has to be k. Let t(k) be the smallest such t. The main contribution of this paper is a proof of the following self similar nature of this question: If t (l) 驴 s, then for any 驴 0 and for k 驴 k_0(l, 驴), t(k) 驴 (\frac{{s + 1}}{{\iota+ 1}} + \varepsilon )k