Carsten Damm, Ki Hang Kim, Fred Roush, Lecture Notes in Computer Science, 1627, Computing and Combinatorics, 1999, 123
Howard Straubing, Lecture Notes in Computer Science, 1373, STACS 98, 1998, 332
D. Grigoriev, A.A. Razborov, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 1998, 269
Uwe Schöning, Randall Pruim, Gems of Theoretical Computer Science, 1998, 101
Alexis Maciel, Denis Thérien, “Threshold Circuits of Small Majority-Depth”, Information and Computation, 146:1 (1998), 55
Cristopher Moore, “Predicting nonlinear cellular automata quickly by decomposing them into linear ones”, Physica D: Nonlinear Phenomena, 111:1-4 (1998), 27
Mikael Goldmann, Johan Håstad, “Monotone Circuits for Connectivity Have Depth (log n)2-o(1)”, SIAM J. Comput., 27:5 (1998), 1283
R. Paturi, P. Pudlak, F. Zane, Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, 566
Alexander A Razborov, Steven Rudich, “Natural Proofs”, Journal of Computer and System Sciences, 55:1 (1997), 24
Domenico Zambella, “Algebraic Methods and Bounded Formulas”, Notre Dame J. Formal Logic, 38:1 (1997)