Jinjie Gao, Haibin Kan, Yuan Li, Jiahua Xu, Qichun Wang, “Monomial Boolean functions with large high-order nonlinearities”, Information and Computation, 297, 2024, 105152
Ryan O'Donnell, Rocco A. Servedio, Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, 517
Meera Sitharam, “Evaluating spectral norms for constant depth circuits with symmetric gates”, Comput Complexity, 5, no. 2, 1995, 167
Kazuyuki Amano, Shoma Tate, “On XOR lemmas for the weight of polynomial threshold functions”, Information and Computation, 269, 2019, 104439
Matthias Krause, 900, STACS 95, 1995, 83
Adam R. Klivans, Alexander A. Sherstov, “Cryptographic hardness for learning intersections of halfspaces”, Journal of Computer and System Sciences, 75, no. 1, 2009, 2
Emanuele Viola, “Guest Column”, SIGACT News, 40, no. 1, 2009, 27
Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu, “Complexity of Hard-Core Set Proofs”, comput. complex., 20, no. 1, 2011, 145
Wenxin Jiang, “On weak base Hypotheses and their implications for boosting regression and classification”, Ann. Statist., 30, no. 1, 2002
Alexis Maciel, Denis Thérien, “Efficient Threshold Circuits for Power Series”, Information and Computation, 152, no. 1, 1999, 62