%0 Journal Article
%A A. S. Kazimirov
%A S. Yu. Reymerov
%T Computational bound on complexity of polynomial representations of Boolean functions
%J The Bulletin of Irkutsk State University. Series Mathematics
%D 2010
%P 33-43
%V 3
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IIGUM_2010_3_4_a3/
%G ru
%F IIGUM_2010_3_4_a3