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}
}
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
3 Citations
21 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Query Complexity, or Why Is It Diicult to Separate NP A \ co-NP A from P A by a Random Oracle A? Manuscript

  • G Ta, Tardos
  • Query Complexity, or Why Is It Diicult to…
  • 1988

Similar Papers

Loading similar papers…