Boolean functions represented by random formulas
Commentationes Mathematicae Universitatis Carolinae, Tome 28 (1987) no. 2, pp. 397-398 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 06E30, 94C10
@article{CMUC_1987_28_2_a19,
     author = {Savick\'y, Petr},
     title = {Boolean functions represented by random formulas},
     journal = {Commentationes Mathematicae Universitatis Carolinae},
     pages = {397--398},
     year = {1987},
     volume = {28},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMUC_1987_28_2_a19/}
}
TY  - JOUR
AU  - Savický, Petr
TI  - Boolean functions represented by random formulas
JO  - Commentationes Mathematicae Universitatis Carolinae
PY  - 1987
SP  - 397
EP  - 398
VL  - 28
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/CMUC_1987_28_2_a19/
LA  - en
ID  - CMUC_1987_28_2_a19
ER  - 
%0 Journal Article
%A Savický, Petr
%T Boolean functions represented by random formulas
%J Commentationes Mathematicae Universitatis Carolinae
%D 1987
%P 397-398
%V 28
%N 2
%U http://geodesic.mathdoc.fr/item/CMUC_1987_28_2_a19/
%G en
%F CMUC_1987_28_2_a19
Savický, Petr. Boolean functions represented by random formulas. Commentationes Mathematicae Universitatis Carolinae, Tome 28 (1987) no. 2, pp. 397-398. http://geodesic.mathdoc.fr/item/CMUC_1987_28_2_a19/

[1] Savage J. E.: The Complexity of Computing. Wiley-Interscience, New York, 1976. | MR | Zbl

[2] Valiant L. G.: Short monotone formulae for the majority function. Journal of Algorithms 5 (1984), 363-366. | MR | Zbl