The average sensitivity of bounded-depth circuits

This publication has 5 references indexed in Scilit:

• Constant depth circuits, Fourier transform, and learnability
  Journal of the ACM, 1993
• Limiting Negations in Constant Depth Circuits
  SIAM Journal on Computing, 1993
• The computational complexity of universal hashing
  Theoretical Computer Science, 1993
• Parity, circuits, and the polynomial-time hierarchy
  Theory of Computing Systems, 1984
• ∑11-Formulae on finite structures
  Annals of Pure and Applied Logic, 1983