Lower bounds for modular counting by circuits with modular gates

David A. Mix Barrington, Howard Straubing. Lower bounds for modular counting by circuits with modular gates. Computational Complexity, 8(3):258-272, 1999. [doi]

@article{BarringtonS99,
  title = {Lower bounds for modular counting by circuits with modular gates},
  author = {David A. Mix Barrington and Howard Straubing},
  year = {1999},
  url = {http://link.springer.de/link/service/journals/00037/bibs/9008003/90080258.htm},
  researchr = {https://researchr.org/publication/BarringtonS99},
  cites = {0},
  citedby = {0},
  journal = {Computational Complexity},
  volume = {8},
  number = {3},
  pages = {258-272},
}