1. Representing boolean functions as polynomials modulo composite numbers;Mix Barrington David A.;Computational Complexity,1994
2. Non-uniform automata over groups
3. [ 3 ] Richard Beigel and Jun Tarui . 1991 . On ACC. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS ’91) , October 1-4, 1991, San Juan, Puerto Rico, IEEE, 783–-792. https://doi.org/10.1109/SFCS. 1991.185449. [3] Richard Beigel and Jun Tarui. 1991. On ACC. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS ’91), October 1-4, 1991, San Juan, Puerto Rico, IEEE, 783–-792. https://doi.org/10.1109/SFCS.1991.185449.
4. [ 4 ] Stanley Burris and John Lawrence . 2005. Results on the equivalence problem for finite groups. Algebra Universalis, 52 (Feb . 2005 ), 495–500. DOI: https://doi.org/10.1007/s00012-004-1895-8 [4] Stanley Burris and John Lawrence. 2005. Results on the equivalence problem for finite groups. Algebra Universalis, 52 (Feb. 2005), 495–500. DOI: https://doi.org/10.1007/s00012-004-1895-8
5. The Complexity of Satisfiability of Small Depth Circuits