Geodesic
Algorithm for searching prohibitions of Boolean functions
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 123-125.

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

An algorithm for search of prohibitions of Boolean function based on the branch and bound method is proposed. It allows to find a prohibition of Boolean function, a prohibition of minimum length or all prohibitions under a specified length.
Keywords: prohibition of Boolean function
Mots-clés : de Bruijn graph. 
@article{PDMA_2013_6_a55,
     author = {D. V. Ryabokon},
     title = {Algorithm for searching prohibitions of {Boolean} functions},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {123--125},
     publisher = {mathdoc},
     number = {6},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a55/}
}
TY  - JOUR
AU  - D. V. Ryabokon
TI  - Algorithm for searching prohibitions of Boolean functions
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2013
SP  - 123
EP  - 125
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2013_6_a55/
LA  - ru
ID  - PDMA_2013_6_a55
ER  - 
%0 Journal Article
%A D. V. Ryabokon
%T Algorithm for searching prohibitions of Boolean functions
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2013
%P 123-125
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2013_6_a55/
%G ru
%F PDMA_2013_6_a55
D. V. Ryabokon. Algorithm for searching prohibitions of Boolean functions. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 123-125. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a55/

[1] Kolegov D. N., “O bulevykh funktsiyakh bez zapreta”, Vestnik Tomskogo gosudarstvennogo universiteta. Prilozhenie, 2005, no. 14, 58–60