Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
David A. Mix Barrington, Howard Straubing. Complex Polynomials and Circuit Lower Bounds for Modular Counting. Computational Complexity, 4:325-338, 1994.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Complex Polynomials and Circuit Lower Bounds for Modular CountingDavid A. Mix Barrington, Howard Straubing. latin 1992: 24-31 Lower Bounds for Modular Counting by Circuits with Modular GatesDavid A. Mix Barrington, Howard Straubing. latin 1995: 60-71 Lower bounds for modular counting by circuits with modular gatesDavid A. Mix Barrington, Howard Straubing. cc, 8(3):258-272, 1999. [doi]
The following publications are possibly variants of this publication: