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. In Ricardo A. Baeza-Yates, Eric Goles Ch., Patricio V. Poblete, editors, LATIN 95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings. Volume 911 of Lecture Notes in Computer Science, pages 60-71, Springer, 1995.

@inproceedings{BarringtonS95,
  title = {Lower Bounds for Modular Counting by Circuits with Modular Gates},
  author = {David A. Mix Barrington and Howard Straubing},
  year = {1995},
  researchr = {https://researchr.org/publication/BarringtonS95},
  cites = {0},
  citedby = {0},
  pages = {60-71},
  booktitle = {LATIN  95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings},
  editor = {Ricardo A. Baeza-Yates and Eric Goles Ch. and Patricio V. Poblete},
  volume = {911},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-59175-3},
}