Mikael Goldmann, Theoretical Advances in Neural Computation and Learning, 1994, 85
Alexis Maciel, Denis Thérien, 665, STACS 93, 1993, 545
Владимир Владимирович Подольский, Vladimir Vladimirovich Podolskii, Александр Александрович Шерстов, Aleksander Aleksandrovich Sherstov, “Уменьшение на единицу степени многочлена с заданной знаковой функцией может экспоненциально увеличить его вес и длину”, УМН, 64, № 5, 2009, 179
Valeriu Beiu, John G. Taylor, “On the Circuit Complexity of Sigmoid Feedforward Neural Networks”, Neural Networks, 9, № 7, 1996, 1155
V. Feldman, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006, 226
Russell Impagliazzo, Sasank Mouli, Toniann Pitassi, Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, 591
Wolfgang Maass, Theoretical Advances in Neural Computation and Learning, 1994, 153
Eike Kiltz, Hans Ulrich Simon, “Threshold circuit lower bounds on cryptographic functions”, Journal of Computer and System Sciences, 71, № 2, 2005, 185
Amos Beimel, Enav Weinreb, “Monotone circuits for monotone weighted threshold functions”, Information Processing Letters, 97, № 1, 2006, 12
Emanuele Viola, “Selected challenges in computational lower bounds”, SIGACT News, 48, № 1, 2017, 39