- Ingo Wegener, “Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions”, Information Processing Letters, 46, no. 2, 1993, 85
- Thomas Hofmeister, Theoretical Advances in Neural Computation and Learning, 1994, 37
- Valeriu Beiu, John G. Taylor, “On the Circuit Complexity of Sigmoid Feedforward Neural Networks”, Neural Networks, 9, no. 7, 1996, 1155
- Vladimir V. Podolskii, “Degree-uniform lower bound on the weights of polynomials with given sign function”, Proc. Steklov Inst. Math., 274, no. 1, 2011, 231