๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computation complexity of the range of a polynomial in several variables

โœ Scribed by A. A. Gaganov

Publisher
Springer US
Year
1986
Tongue
English
Weight
268 KB
Volume
21
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The communication complexity of several
The communication complexity of several problems in matrix computation
โœ Jeff I Chu; Georg Schnitger ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 747 KB

The communication complexity of a function f measures the communication resources required for computingf. In the design of VLSI systems, where savings on the chip area and computation time are desired, this complexity dictates an area x time\* lower bound. We investigate the communication complexit

On a Lower-Bound for the Absolute Value
On a Lower-Bound for the Absolute Value of a Polynomial of Several Complex Variables
โœ B. Paneah ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 268 KB

For an arbitrary polynomial \(P\left(z_{1}, z_{2}, \ldots, z_{n}\right)\) in complex space \(\mathbb{C}^{n}\) we describe a set of nonnegative multi-indices \(\alpha=\left(\alpha_{1}, \alpha_{2}, \ldots, \alpha_{n}\right)\) such that for any \(n\)-tuple \(\delta=\left(\delta_{1}, \delta_{2}, \ldots,