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]
@article{Bernasconi01,
title = {On a hierarchy of Boolean functions hard to compute in constant depth},
author = {Anna Bernasconi},
year = {2001},
url = {http://dmtcs.loria.fr/volumes/abstracts/dm040201.abs.html},
researchr = {https://researchr.org/publication/Bernasconi01},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics & Theoretical Computer Science},
volume = {4},
number = {2},
pages = {79-90},
}