%0 Journal Article
%A K. D. Kirichenko
%T An upper bound for the complexity of polynomial normal forms of Boolean functions
%J Diskretnaya Matematika
%D 2005
%P 80-88
%V 17
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2005_17_3_a7/
%G ru
%F DM_2005_17_3_a7