On a hierarchy of Boolean functions hard to compute in constant depth.
Bernasconi, Anna
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 4 (2001), p. 79-90 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Access to full text
Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:121218 
@article{01597542,
     title = {On a hierarchy of Boolean functions hard to compute in constant depth.},
     journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
     volume = {4},
     year = {2001},
     pages = {79-90},
     zbl = {0968.68054},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01597542}
}

Bernasconi, Anna. On a hierarchy of Boolean functions hard to compute in constant depth.. Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 4 (2001) pp. 79-90. http://gdmltest.u-ga.fr/item/01597542/