k-juntas, low-degree Fourier functions, and sparse polynomials are testable with O(1/ε) queries independent of n for small ε.
An asymptotically tight bound on the number of relevant variables in a bounded degree B oolean function
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Exposition of the result that Boolean degree one functions on J_q(n,k) are trivial when min(k,n-k) >= 2 and n is large enough.
citing papers explorer
-
Classes Testable with $O(1/\epsilon)$ Queries for Small $\epsilon$ Independent of the Number of Variables
k-juntas, low-degree Fourier functions, and sparse polynomials are testable with O(1/ε) queries independent of n for small ε.
-
Boolean degree one functions on the Grassmann scheme
Exposition of the result that Boolean degree one functions on J_q(n,k) are trivial when min(k,n-k) >= 2 and n is large enough.