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
David A. Mix Barrington, Richard Beigel, Steven Rudich, “Representing Boolean functions as polynomials modulo composite numbers”, Comput Complexity, 4:4 (1994), 367
P. Pudlák, Lecture Notes in Computer Science, 710, Fundamentals of Computation Theory, 1993, 106
M. Karchmer, A. Wigderson, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993, 102
Mario Szegedy, “Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC”, Journal of Computer and System Sciences, 47:3 (1993), 405
Rafi Heiman, Ilan Newman, Avi Wigderson, “On read-once threshold formulae and their randomized decision tree complexity”, Theoretical Computer Science, 107:1 (1993), 63