Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola, “Bounded Independence Fools Halfspaces”, SIAM J. Comput., 39, no. 8, 2010, 3441
Anindya De, Rocco A. Servedio, Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, 832
Vitaly Feldman, Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, 619
Mikael Goldmann, Marek Karpinski, “Simulating Threshold Circuits by Majority Circuits”, SIAM J. Comput., 27, no. 1, 1998, 230
Vladimir V. Podolskii, 5010, Computer Science – Theory and Applications, 2008, 261
Arkadev Chattopadhyay, Nikhil Mande, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, 47
Alexander A. Sherstov, “The unbounded-error communication complexity of symmetric functions”, Combinatorica, 31, no. 5, 2011, 583
L. Fortnow, R. Impagliazzo, V. Kabanets, C. Umans, 20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005, 323
Rocco A. Servedio, “Monotone Boolean formulas can approximate monotone linear threshold functions”, Discrete Applied Mathematics, 142, no. 1-3, 2004, 181
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan, “A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates”, Algorithmica, 84, no. 4, 2022, 1132