A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Almost Optimal Testers for Concise Representations
[article]
2019
arXiv
pre-print
We give improved and almost optimal testers for several classes of Boolean functions on n inputs that have concise representation in the uniform and distribution-free model. Classes, such as k-junta, k-linear functions, s-term DNF, s-term monotone DNF, r-DNF, decision list, r-decision list, size-s decision tree, size-s Boolean formula, size-s branching programs, s-sparse polynomials over the binary field and function with Fourier degree at most d. The method can be extended to several other
arXiv:1904.09958v3
fatcat:3o2zksdzzrgtjljwmfxbys423a