|
This article is cited in 3 scientific papers (total in 3 papers)
On the complexity of the computation of systems of monomials with restrictions on the powers of the variables
V. V. Kochergin
Abstract:
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.
Received: 04.02.1998
Citation:
V. V. Kochergin, “On the complexity of the computation of systems of monomials with restrictions on the powers of the variables”, Diskr. Mat., 10:3 (1998), 27–34; Discrete Math. Appl., 8:4 (1998), 375–382
Linking options:
https://www.mathnet.ru/eng/dm434https://doi.org/10.4213/dm434 https://www.mathnet.ru/eng/dm/v10/i3/p27
|
|