Geodesic
Complexity of Boolean functions in a class of polynomial
Algebra i logika, Tome 34 (1995) no. 3, pp. 323-326.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{AL_1995_34_3_a6,
     author = {N. A. Peryazev},
     title = {Complexity of {Boolean} functions in a class of polynomial},
     journal = {Algebra i logika},
     pages = {323--326},
     publisher = {mathdoc},
     volume = {34},
     number = {3},
     year = {1995},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_1995_34_3_a6/}
}
TY  - JOUR
AU  - N. A. Peryazev
TI  - Complexity of Boolean functions in a class of polynomial
JO  - Algebra i logika
PY  - 1995
SP  - 323
EP  - 326
VL  - 34
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_1995_34_3_a6/
LA  - ru
ID  - AL_1995_34_3_a6
ER  - 
%0 Journal Article
%A N. A. Peryazev
%T Complexity of Boolean functions in a class of polynomial
%J Algebra i logika
%D 1995
%P 323-326
%V 34
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_1995_34_3_a6/
%G ru
%F AL_1995_34_3_a6
N. A. Peryazev. Complexity of Boolean functions in a class of polynomial. Algebra i logika, Tome 34 (1995) no. 3, pp. 323-326. http://geodesic.mathdoc.fr/item/AL_1995_34_3_a6/