Normal algorithms connected with the computation of boolean functions
Izvestiya. Mathematics , Tome 1 (1967) no. 1, pp. 151-194
Voir la notice de l'article provenant de la source Math-Net.Ru
The article deals with lower and upper bounds for the complexity of normal algorithms related to the computation of Boolean functions.
@article{IM2_1967_1_1_a9,
author = {A. A. Markov},
title = {Normal algorithms connected with the computation of boolean functions},
journal = {Izvestiya. Mathematics },
pages = {151--194},
publisher = {mathdoc},
volume = {1},
number = {1},
year = {1967},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IM2_1967_1_1_a9/}
}
A. A. Markov. Normal algorithms connected with the computation of boolean functions. Izvestiya. Mathematics , Tome 1 (1967) no. 1, pp. 151-194. http://geodesic.mathdoc.fr/item/IM2_1967_1_1_a9/