Author:
Amano Kazuyuki,Maruoka Akira
Subject
General Computer Science,Theoretical Computer Science
Reference10 articles.
1. Inequalities in Fourier analysis;Beckner;Ann. Math.,1975
2. M. Ben-Or, N. Linial, Collective coin flipping, robust voting games and minima of Banzhaf values, Proc. 26th FOCS, 1985, pp. 408–416.
3. A. Blum, C. Burch, J. Langford, On learning monotone Boolean functions, Proc. 39th FOCS, 1998, pp. 408–415.
4. On the Fourier spectrum of monotone functions;Bshouty;JACM,1996
5. A simple proof of the Kruskal–Katona theorem;Daykin;J. Combin. Theory (A),1974
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Agnostic proper learning of monotone functions: beyond the black-box correction barrier;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Properly learning monotone functions via local correction;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. Tight Bounds on Low-Degree Spectral Concentration of Submodular and XOS Functions;2015 IEEE 56th Annual Symposium on Foundations of Computer Science;2015-10
4. KKL, Kruskal--Katona, and Monotone Nets;SIAM Journal on Computing;2013-01
5. KKL, Kruskal-Katona, and Monotone Nets;2009 50th Annual IEEE Symposium on Foundations of Computer Science;2009-10