Threshold Circuits of Small Majority -

@inproceedings{DepthAlexis1995ThresholdCO,
  title={Threshold Circuits of Small Majority -},
  author={DepthAlexis and Maciel},
  year={1995}
}
  • DepthAlexis, Maciel
  • Published 1995
Constant-depth polynomial-size threshold circuits are usually classi ed according to their total depth. For example, the best known threshold circuits for iterated multiplication and division have depth four and three, respectively. In this paper, the complexity of threshold circuits is investigated from a di erent point of view: explicit AND, OR gates are allowed in the circuits, and a threshold circuit is said to have majority-depth d if no path traverses more than d threshold gates. It is… CONTINUE READING