Sorin Draghici, “On the capabilities of neural networks using limited precision weights”, Neural Networks, 15, no. 3, 2002, 395
Srinivasan Arunachalam, Alex Bredariol Grilo, Aarthi Sundaram, “Quantum Hardness of Learning Shallow Classical Circuits”, SIAM J. Comput., 50, no. 3, 2021, 972
Kazuyuki Amano, Akira Maruoka, 3618, Mathematical Foundations of Computer Science 2005, 2005, 107
Rüdiger Reischuk, “Can large fanin circuits perform reliable computations in the presence of faults?”, Theoretical Computer Science, 240, no. 2, 2000, 319
Lijie Chen, Hanlin Ren, “Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization”, SIAM J. Comput., 51, no. 3, 2022, STOC20-115
Alexander A. Sherstov, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007, 83
Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu, 4596, Automata, Languages and Programming, 2007, 183
Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, “Polynomial threshold functions and Boolean threshold circuits”, Information and Computation, 240, 2015, 56
Yogesh Dahiya, Vignesh K., Meena Mahajan, Karteek Sreenivasaiah, “Linear threshold functions in decision lists, decision trees, and depth-2 circuits”, Information Processing Letters, 183, 2024, 106418
Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 764