S.-C. Tsai, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993, 96
R. Smolensky, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 1993, 130
R. Beigel, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993, 82
Carl Sturtivant, Gudmund Skovbjerg Frandsen, “The computational efficacy of finite-field arithmetic”, Theoretical Computer Science, 112:2 (1993), 291
J. Hastad, S. Jukna, P. Pudlak, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 1993, 124
Jehoshua Bruck, Roman Smolensky, “Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms”, SIAM J. Comput., 21:1 (1992), 33
Joan Boyar, Gudmund Frandsen, Carl Sturtivant, “An arithmetic model of computation equivalent to threshold circuits”, Theoretical Computer Science, 93:2 (1992), 303
D.A.M. Barrington, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992, 86
David A. Mix Barrington, Kevin Compton, Howard Straubing, Denis Thérien, “Regular languages in NC1”, Journal of Computer and System Sciences, 44:3 (1992), 478
Richard Beigel, Jun Tarui, Seinosuke Toda, Lecture Notes in Computer Science, 650, Algorithms and Computation, 1992, 420