M. Agrawal, E. Allender, S. Datta, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 1997, 134
R. Beigel, A. Maciel, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 1997, 149
Pierre Péladeau, Howard Straubing, Denis Therien, “Finite semigroup varieties defined by programs”, Theoretical Computer Science, 180:1-2 (1997), 325
Shi-Chun Tsai, “Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $”, SIAM J. Discrete Math., 9:1 (1996), 55
Jordan Gergov, Christoph Meinel, “Mod-2-OBDDs—A data structure that generalizes EXOR-sum-of-products and ordered binary decision diagrams”, Form Method Syst Des, 8:3 (1996), 273
Hervé Caussinus, “A note on a theorem of Barrington, Straubing and Thérien”, Information Processing Letters, 58:1 (1996), 31
Jehoshua Bruck, “Reflections on ?Representations of sets of Boolean functions by commutative rings? by Roman Smolensky”, Comput Complexity, 6:3 (1996), 209
Richard Beigel, Alexis Maciel, “Upper and lower bounds for some depth-3 circuit classes”, Comput Complexity, 6:3 (1996), 235
Iain A. Stewart, Collegium Logicum, 2, Collegium Logicum, 1996, 101
E. N. Mayoraz, “On the Power of Democratic Networks”, SIAM J. Discrete Math., 9:2 (1996), 258