Eric Allender, Lecture Notes in Computer Science, 1090, Computing and Combinatorics, 1996, 127
A. A. Razborov, “Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic”, Изв. РАН. Сер. матем., 59:1 (1995), 201–224 ; Izv. Math., 59:1 (1995), 205–227
G. Tardos, D.A.M. Barrington, Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995, 52
J. H�stad, S. Jukna, P. Pudl�k, “Top-down lower bounds for depth-three circuits”, Comput Complexity, 5:2 (1995), 99
Meera Sitharam, “Evaluating spectral norms for constant depth circuits with symmetric gates”, Comput Complexity, 5:2 (1995), 167
A. Gal, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference, 1995, 82
Alexander A. Razborov, Feasible Mathematics II, 1995, 344
J. Kobler, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference, 1995, 246
Mikael Goldmann, “A note on the power of majority gates and modular gates”, Information Processing Letters, 53:6 (1995), 321
V.P. Roychowdhury, A. Orlitsky, Kai-Yeung Siu, “Lower bounds on threshold and related circuits via communication complexity”, IEEE Trans. Inform. Theory, 40:2 (1994), 467