David A. Mix Barrington Howard Straubing Lower bounds for modular counting by circuits with modular gates. 258-272 1999 8 Computational Complexity 3 http://link.springer.de/link/service/journals/00037/bibs/9008003/90080258.htm db/journals/cc/cc8.html#BarringtonS99