1. A lower bound for primality;Allender;J. Comp. Syst. Sci.,2001
2. On the Complexity of Balanced Boolean functions;Bernasconi,1997
3. Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth;Bernasconi,1998
4. Measures of Boolean Function Complexity Based on Harmonic Analysis;Bernasconi,1994
5. Bernasconi, A., Codenotti, B., and Simon, J.1996, On the Fourier Analysis of Boolean Functions, preprint, pp. 1–24.