1. Agrawal, M., Allender, E., Datta, S.: On TC0, AC0, and arithmetic circuits. Journal of Computer and System Sciences 60, 395–421 (2000)
2. Allender, E.: Arithmetic circuits and counting complexity classes. In: Krajíček, J. (ed.) Complexity of Computations and Proofs. Quaderni di Matematica, vol. 13, pp. 33–72. Seconda Università di Napoli (2004)
3. Lecture Notes in Computer Science;A. Ambainis,1999
4. Barrington, D.A.: Width-3 permutation branching programs. Technical Report Technical Memorandum MIT/LCS/TM-293, MIT (1985)
5. Ben-Or, M., Cleve, R.: Computing algebraic formulas using a constant number of registers. In: Proc. ACM Symp. on Theory of Computing (STOC), pp. 254–257 (1988)