%0 Journal Article
%A È. È. Gasanov
%T A lower bound for the complexity of inclusive search in the class of tree-like circuits
%J Diskretnaya Matematika
%D 1998
%P 63-72
%V 10
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1998_10_1_a5/
%G ru
%F DM_1998_10_1_a5