%0 Journal Article
%A D. Yu. Cherukhin
%T Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
%J Diskretnaya Matematika
%D 2011
%P 39-47
%V 23
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2011_23_4_a2/
%G ru
%F DM_2011_23_4_a2