Cybernetics

, Volume 21, Issue 4, pp 418–421 | Cite as

Computation complexity of the range of a polynomial in several variables

  • A. A. Gaganov
Article
Received:

Keywords

Operating System Artificial Intelligence System Theory Computation Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    R. E. Moore, “On computing the range of a rational function of n variables over a bounded region,” Computing,16, No. 1–2, 1–15 (1976).Google Scholar
  2. 2.
    Yu. I. Shokin, Interval Analysis [in Russian], Nauka, Novosibirsk (1981).Google Scholar
  3. 3.
    M. A. Frumkin, “The complexity of discrete problems,” Preprint, Akad. Nauk SSSR, Tsentr. Ékon. Mat. Inst., Moscow (1981).Google Scholar
  4. 4.
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (1974).Google Scholar

Copyright information

© Plenum Publishing Corporation 1986

Authors and Affiliations

  • A. A. Gaganov

There are no affiliations available

Personalised recommendations