Highly Influenced

# Complexity of Symmetric Functions in Perceptron-Like Models

@inproceedings{Zhang1992ComplexityOS, title={Complexity of Symmetric Functions in Perceptron-Like Models}, author={Zhi-Li Zhang}, year={1992} }

- Published 1992

We examine the size complexity of the symmetric boolean functions in two circuit models containing threshold gates: the d-perceptron model [BRS, ABFR] (a single threshold function of constant-depth AND/OR circuits) and the parity-threshold model studied by Bruck [Br] (a single threshold function of exclusive-ORs). These models are intermediate between the well-understood model of constant-depth AND/OR circuits and the still mysterious model of general constantdepth threshold circuits. In the d… CONTINUE READING