Boolean Functions with Small Approximate Spectral Norm

被引:0
|
作者
Cheung, Tsun-Ming [1 ]
Hatami, Hamed [1 ]
Zhao, Rosie [1 ]
Zilberstein, Itai [1 ]
机构
[1] McGill Univ, Sch Comp Sci, Montreal, PQ, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Theoretical computer science; Boolean analysis; Complexity theory; IDEMPOTENT; THEOREM;
D O I
10.19086/da.122971
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The sum of the absolute values of the Fourier coefficients of a function f : F-n(2) -> R is called the spectral norm off. Green and Sanders' quantitative version of Cohen's idempotent theorem states that if the spectral norm off : F-n(2) -> {0,1} is at most M, then the support off belongs to the ring of sets generated by at most l(M) cosets, where l(M) is a constant that only depends on M. We prove that the above statement can be generalized to approximate spectral norms if and only if the support off and its complement satisfy a certain arithmetic connectivity condition. In particular, our theorem provides a new proof of the quantitative Cohen's theorem for F-n(2).
引用
收藏
页数:22
相关论文
共 50 条