D. A. M. Barrington, R. Beigel, and S. Rudich. Representing Boolean
functions as polynomials modulo composite numbers. Comput. Complexity,
4:367-382, 1994. Appeared also in Proc. 24th Ann. ACM Symp. Theor.\
D. A. M. Barrington, H. Straubing, and D. Thérien. Non-uniform
automata over groups. Information and Computation, 89:109-132, 1990.
G. Tardos and D. A. M. Barrington. A lower bound on the MOD 6 degree
of the OR function. In Proceedings of the Third Israel Symosium on the
Theory of Computing and Systems (ISTCS'95), pages 52-56, 1995.