Geodesic
Lower bounds for complexity of monotone computation of polynomials and universal schemes
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 8 (1985), pp. 35-42 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{IVM_1985_8_a4,
     author = {R. G. Nigmatullin},
     title = {Lower bounds for complexity of monotone computation of polynomials and universal schemes},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {35--42},
     year = {1985},
     number = {8},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1985_8_a4/}
}
TY  - JOUR
AU  - R. G. Nigmatullin
TI  - Lower bounds for complexity of monotone computation of polynomials and universal schemes
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1985
SP  - 35
EP  - 42
IS  - 8
UR  - http://geodesic.mathdoc.fr/item/IVM_1985_8_a4/
LA  - ru
ID  - IVM_1985_8_a4
ER  - 
%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
%U http://geodesic.mathdoc.fr/item/IVM_1985_8_a4/
%G ru
%F IVM_1985_8_a4
R. G. Nigmatullin. Lower bounds for complexity of monotone computation of polynomials and universal schemes. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 8 (1985), pp. 35-42. http://geodesic.mathdoc.fr/item/IVM_1985_8_a4/