Eric Allender, Ulrich Hertrampf, Lecture Notes in Computer Science, 452, Mathematical Foundations of Computer Science 1990, 1990, 158
Ravi B. BOPPANA, Michael SIPSER, Algorithms and Complexity, 1990, 757
David A. Mix Barrington, Neil Immerman, Howard Straubing, “On uniformity within NC1”, Journal of Computer and System Sciences, 41:3 (1990), 274
J. Bruck, R. Smolensky, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 1990, 632
Jin-yi Cai, “Lower bounds for constant-depth circuits in the presence of help bits”, Information Processing Letters, 36:2 (1990), 79
R. Heiman, I. Newman, A. Wigderson, Proceedings Fifth Annual Structure in Complexity Theory Conference, 1990, 78
Jehoshua Bruck, “Harmonic Analysis of Polynomial Threshold Functions”, SIAM J. Discrete Math., 3:2 (1990), 168
David A. Mix Barrington, James Corbett, “On the relative complexity of some languages in NC1”, Information Processing Letters, 32:5 (1989), 251
J.-Y. Cai, 30th Annual Symposium on Foundations of Computer Science, 1989, 532