Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Agrawal, M., Allender, E., Rudich, S.: Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. JCSS 57, 17–143 (1998)
2. Álvarez, C., Balcázar, J.L., Jenner, B.: Adaptive Logspace Reducibilities and Parallel Time. Math. Systems Theory 28, 117–140 (1995)
3. Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC1. Journal of Computer and System Sciences 41, 274–306 (1990)
4. Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Information and Control 64(1), 2–22 (1985)
5. Lecture Notes in Computer Science,1982