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
Mikael Goldmann, Johan Håstad, “A simple lower bound for monotone clique using a communication game”, Information Processing Letters, 41:4 (1992), 221
Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack, Lecture Notes in Computer Science, 577, STACS 92, 1992, 279
И. Е. Шпарлинский, “О некоторых вопросах теории конечных полей”, УМН, 46:1(277) (1991), 165–200 ; I. E. Shparlinski, “On some problems in the theory of finite fields”, Russian Math. Surveys, 46:1 (1991), 199–240
R. Beigel, N. Reingold, D. Spielman, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991, 286
R. Beigel, J. Tarui, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991, 783