On a hierarchy of Boolean functions hard to compute in constant depth

Anna Bernasconi. On a hierarchy of Boolean functions hard to compute in constant depth. Discrete Mathematics & Theoretical Computer Science, 4(2):79-90, 2001. [doi]

Authors

Anna Bernasconi

This author has not been identified. Look up 'Anna Bernasconi' in Google