Representing Boolean functions as polynomials modulo composite numbers

Authors:
David A. Mix Barrington;Richard Beigel;Steven Rudich
Affiliations:
Computer Science Dept., U. of Massachusetts, Amherst, MA;Dept. of Computer Science, 51 Prospect Street, P.O. Box 2158, Yale Station, New Haven, CT;School of Computer Science, Carnegie Mellon University, 5000 Forbes Ave, Pittsburgh, PA
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Citing 4
Cited 3

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
A Note on a Theorem of Razborov

A Note on a Theorem of Razborov
Non-Uniform Automata Over Groups

Non-Uniform Automata Over Groups
The Current State of Circuit Lower Bounds

The Current State of Circuit Lower Bounds

A weight-size trade-off for circuits with MOD m gates

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Co-orthogonal Codes

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Representing the boolean OR function by quadratic polynomials modulo 6

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract