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
Eric Allender, Vivek Gore, “A Uniform Circuit Lower Bound for the Permanent”, SIAM J. Comput., 23:5 (1994), 1026
J. Aspnes, R. Beigel, M. Furst, S. Rudich, “The expressive power of voting polynomials”, Combinatorica, 14:2 (1994), 135
Lance Fortnow, Lecture Notes in Computer Science, 880, Foundation of Software Technology and Theoretical Computer Science, 1994, 256
Noam Nisan, Mario Szegedy, “On the degree of boolean functions as real polynomials”, Comput Complexity, 4:4 (1994), 301
Richard Beigel, Jun Tarui, “On ACC”, Comput Complexity, 4:4 (1994), 350