%0 Journal Article
%A È. È. Gasanov
%T A lower bound for the complexity of information networks for a partial ordering relation
%J Diskretnaya Matematika
%D 1996
%P 108-122
%V 8
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1996_8_4_a8/
%G ru
%F DM_1996_8_4_a8