Lower bounds for modular counting by circuits with modular gates

Authors

DAM Barrington
H Straubing

Publication Date

1999

Journal or Book Title

COMPUTATIONAL COMPLEXITY

Pages

258-272

Volume

8

Issue

3

Recommended Citation

Barrington, DAM and Straubing, H, "Lower bounds for modular counting by circuits with modular gates" (1999). COMPUTATIONAL COMPLEXITY. 309.
Retrieved from https://scholarworks.umass.edu/cs_faculty_pubs/309