Geodesic
On the complexity of the computation of systems of monomials with restrictions on the powers of the variables
Diskretnaya Matematika, Tome 10 (1998) no. 3, pp. 27-34 
V. V. Kochergin. On the complexity of the computation of systems of monomials with restrictions on the powers of the variables. Diskretnaya Matematika, Tome 10 (1998) no. 3, pp. 27-34. http://geodesic.mathdoc.fr/item/DM_1998_10_3_a2/
@article{DM_1998_10_3_a2,
     author = {V. V. Kochergin},
     title = {On the complexity of the computation of systems of monomials with restrictions on the powers of the variables},
     journal = {Diskretnaya Matematika},
     pages = {27--34},
     year = {1998},
     volume = {10},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1998_10_3_a2/}
}
TY  - JOUR
AU  - V. V. Kochergin
TI  - On the complexity of the computation of systems of monomials with restrictions on the powers of the variables
JO  - Diskretnaya Matematika
PY  - 1998
SP  - 27
EP  - 34
VL  - 10
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/DM_1998_10_3_a2/
LA  - ru
ID  - DM_1998_10_3_a2
ER  - 
%0 Journal Article
%A V. V. Kochergin
%T On the complexity of the computation of systems of monomials with restrictions on the powers of the variables
%J Diskretnaya Matematika
%D 1998
%P 27-34
%V 10
%N 3
%U http://geodesic.mathdoc.fr/item/DM_1998_10_3_a2/
%G ru
%F DM_1998_10_3_a2

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider the complexity of calculating systems of monomials in several variables and obtain a generalization of the well-known Pippenger result to the case of distinct upper bounds for the powers of variables in the monomials.This research was supported by the Russian Foundation for Basic Research, grant 96–01–01068, and by Federal Project ‘Integration’, grant 473.