%0 Journal Article
%A R. G. Nigmatullin
%T Lower bounds for complexity of monotone computation of polynomials and universal schemes
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1985
%P 35-42
%N 8
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_1985_8_a4/
%G ru
%F IVM_1985_8_a4