Vwani Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Theoretical Advances in Neural Computation and Learning, 1994, 3
Valentine Kabanets, Daniel M. Kane, Zhenjian Lu, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, 615
Susanna de Rezende, Or Meir, Jakob Nordstrom, Toniann Pitassi, Robert Robere, Marc Vinyals, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, 24
Viswanath Annampedu, Meghanad D. Wagh, “Decomposition of threshold functions into bounded fan-in threshold functions”, Information and Computation, 227, 2013, 84
V. V. Podolskii, A. A. Sherstov, “A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length”, Math Notes, 87, no. 5-6, 2010, 860
Adam Klivans, Alexander Sherstov, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006, 553
Vladimir V. Podolskii, “Exponential lower bound for bounded depth circuits with few threshold gates”, Information Processing Letters, 112, no. 7, 2012, 267
Hamid Jahanjou, Eric Miles, Emanuele Viola, 9134, Automata, Languages, and Programming, 2015, 749
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama, “Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression”, Journal of Computer and System Sciences, 105, 2019, 87
Matthias Krause, Pavel Pudlák, “On the computational power of depth-2 circuits with threshold and modulo gates”, Theoretical Computer Science, 174, no. 1-2, 1997, 137