1. Ajtai, M.: $$\varSigma $$$$_{1}^{1}$$- formulae on finite structures. Ann. Pure Appl. Logic 24(1), 1–48 (1983)
2. Lecture Notes in Computer Science;E Allender,1991
3. Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in $${\sf NC}^1$$. J. Comput. Syst. Sci. 38(1), 150–164 (1989)
4. Beigel, R., Tarui, J.: On $${\sf ACC}$$ (circuit complexity). In: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp. 783–792. IEEE (1991)
5. Bhrushundi, A., Hosseini, K., Lovett, S., Rao, S.: Torus polynomials: an algebraic approach to $${\sf ACC}$$ lower bounds. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)