%0 Journal Article
%A S. N. Selezneva
%T On the complexity of recognizing the completeness of sets of Boolean functions realized by Zhegalkin polynomials
%J Diskretnaya Matematika
%D 1997
%P 24-31
%V 9
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1997_9_4_a2/
%G ru
%F DM_1997_9_4_a2