𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity bound for the absolute factorization of parametric polynomials

✍ Scribed by A. Ayad

Publisher
Springer US
Year
2006
Tongue
English
Weight
538 KB
Volume
134
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds for Absolute Positiveness of Mult
Bounds for Absolute Positiveness of Multivariate Polynomials
✍ H. Hong πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 451 KB

A multivariate polynomial P (x 1 , . . . , xn) with real coefficients is said to be absolutely positive from a real number B iff it and all of its non-zero partial derivatives of every order are positive for x 1 , . . . , xn β‰₯ B. We call such B a bound for the absolute positiveness of P . This paper

The parametrized complexity of knot poly
The parametrized complexity of knot polynomials
✍ J.A. Makowsky; J.P. MariΓ±o πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 195 KB

We study the parametrized complexity of the knot (and link) polynomials known as Jones polynomials, Kauffman polynomials and HOMFLY polynomials. It is known that computing these polynomials is xP hard in general. We look for parameters of the combinatorial presentation of knots and links which make

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,