Geodesic
Classes of Boolean functions with limited complexity
Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 58-60

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

The following classes of Boolean functions are considered: with given or limited number of essential variables, of given or limited degree, with given or limited ANF length, having non-repeated ANF. The numbers of functions in the classes and the affiliation tests are given. The algorithm for specifying of a partially defined function to a function of limited degree is presented.
Keywords: essential dependence of a function on a variable, Boolean function degree
Mots-clés : algebraic normal form. 
@article{PDMA_2019_12_a16,
     author = {A. I. Metalnikova and I. A. Pankratova},
     title = {Classes of {Boolean} functions with limited complexity},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {58--60},
     publisher = {mathdoc},
     number = {12},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2019_12_a16/}
}
TY  - JOUR
AU  - A. I. Metalnikova
AU  - I. A. Pankratova
TI  - Classes of Boolean functions with limited complexity
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2019
SP  - 58
EP  - 60
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2019_12_a16/
LA  - ru
ID  - PDMA_2019_12_a16
ER  - 
%0 Journal Article
%A A. I. Metalnikova
%A I. A. Pankratova
%T Classes of Boolean functions with limited complexity
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2019
%P 58-60
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2019_12_a16/
%G ru
%F PDMA_2019_12_a16
A. I. Metalnikova; I. A. Pankratova. Classes of Boolean functions with limited complexity. Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 58-60. http://geodesic.mathdoc.fr/item/PDMA_2019_12_a16/