Publisher
Springer Nature Switzerland
Reference23 articles.
1. Mix Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in $${NC}^1$$. J. Comput. Syst. Sci. 38(1), 150–164 (1989)
2. Bartholdi, L., Figelius, M., Lohrey, M., Weiß, A.: Groups with ALogTime-hard word problems and PSpace-complete circuit value problems. In: Saraf, S. (ed.) 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 169, pp. 29:1–29:29. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2020)
3. Bartholdi, L., Mitrofanov, I.: The word and order problems for self-similar and automata groups. Groups Geom. Dyn. 14, 705–728 (2020)
4. Bartholdi, L., Silva, P.: Groups defined by automata. In: Pin, J.E. (ed.) Handbook of Automata Theory, vol. II, chap. 24, pp. 871–911. European Mathematical Society (2021)
5. Bassino, F., et al.:Complexity and Randomness in Group Theory. De Gruyter (2020)