Boolean functions represented by random formulas
Commentationes Mathematicae Universitatis Carolinae (1987)
- Volume: 028, Issue: 2, page 397-398
- ISSN: 0010-2628
Access Full Article
top
How to cite
topSavický, Petr. "Boolean functions represented by random formulas." Commentationes Mathematicae Universitatis Carolinae 028.2 (1987): 397-398. <http://eudml.org/doc/17553>.
@article{Savický1987,
author = {Savický, Petr},
journal = {Commentationes Mathematicae Universitatis Carolinae},
language = {eng},
number = {2},
pages = {397-398},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {Boolean functions represented by random formulas},
url = {http://eudml.org/doc/17553},
volume = {028},
year = {1987},
}
TY - JOUR
AU - Savický, Petr
TI - Boolean functions represented by random formulas
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1987
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 028
IS - 2
SP - 397
EP - 398
LA - eng
UR - http://eudml.org/doc/17553
ER -
References
top- Savage J. E., The Complexity of Computing, Wiley-Interscience, New York, 1976. (1976) Zbl0391.68025MR0495205
- Valiant L. G., Short monotone formulae for the majority function, Journal of Algorithms 5 (1984), 363-366. (1984) Zbl0554.94017MR0756162
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.