Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 764
Л. Бабаи, К. А. Хансен, В. В. Подольский, Сяомин Сюн, “Веса точных пороговых функций”, Изв. РАН. Сер. матем., 85:6 (2021), 5–26 ; L. Babai, K. A. Hansen, V. V. Podolskii, Xiaoming Sun, “Weights of exact threshold functions”, Izv. Math., 85:6 (2021), 1039–1059
Bun M., Thaler J., “The Large-Error Approximate Degree of Ac(0)”, Theory Comput., 17:SI (2021)
Pierre Baldi, Roman Vershynin, “Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors”, SIAM Journal on Mathematics of Data Science, 1:4 (2019), 699
De A., Servedio R.A., “A New Central Limit Theorem and Decomposition For Gaussian Polynomials, With An Application to Deterministic Approximate Counting”, Probab. Theory Relat. Field, 171:3-4 (2018), 981–1044
Rao Yanyi, Zhang Xianda, “The Characterizations of Hyper-Star Graphs Induced By Linearly Separable Boolean Functions”, Chin. J. Electron., 27:1, 1 (2018), 19–25
Rao Ya., Zhang X., “Characterization of Linearly Separable Boolean Functions: a Graph-Theoretic Perspective”, IEEE Trans. Neural Netw. Learn. Syst., 28:7 (2017), 1542–1549
Viola E., “the Communication Complexity of Addition”, Combinatorica, 35:6 (2015), 703–747
De A., Diakonikolas I., Servedio R.A., “Deterministic Approximate Counting For Juntas of Degree-2 Polynomial Threshold Functions”, 2014 IEEE 29Th Conference on Computational Complexity (Ccc), IEEE Conference on Computational Complexity, IEEE, 2014, 229–240
Anindya De, Rocco A. Servedio, Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, 832