The Average Sensitivity of Bounded-Depth Circuits

@article{Boppana1997TheAS,
  title={The Average Sensitivity of Bounded-Depth Circuits},
  author={Ravi B. Boppana},
  journal={Inf. Process. Lett.},
  year={1997},
  volume={63},
  pages={257-261}
}
The average sensitivity of a Boolean circuit is the expected number of input bits that, when flipped, change the output of the circuit, starting with a random input setting. We show that unbounded-fanin circuits of depth d and size s have average sensitivity 0( log s)~-‘. This bound is asymptotically tight. @ 1997 Elsevier Science B.V. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

If-formulae on finite structures, Ann

  • M. Ajtai
  • Pure Appl. Logic
  • 1983

A method of determining lower bounds for the complexity of /I-schemes, Mar

  • V. M. Khrapchenko
  • English translation in: Mafh. Notes Acnd. Sci…
  • 1971

Similar Papers

Loading similar papers…