On a hierarchy of Boolean functions hard to compute in constant depth.
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2001)
- Volume: 4, Issue: 2, page 79-90
- ISSN: 1365-8050
Access Full Article
top
How to cite
topBernasconi, Anna. "On a hierarchy of Boolean functions hard to compute in constant depth.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 4.2 (2001): 79-90. <http://eudml.org/doc/121218>.
@article{Bernasconi2001,
author = {Bernasconi, Anna},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {general models of computation; Boolean functions},
language = {eng},
number = {2},
pages = {79-90},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {On a hierarchy of Boolean functions hard to compute in constant depth.},
url = {http://eudml.org/doc/121218},
volume = {4},
year = {2001},
}
TY - JOUR
AU - Bernasconi, Anna
TI - On a hierarchy of Boolean functions hard to compute in constant depth.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2001
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 4
IS - 2
SP - 79
EP - 90
LA - eng
KW - general models of computation; Boolean functions
UR - http://eudml.org/doc/121218
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.