𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of a PL homotopy algorithm for zeros of polynomials

✍ Scribed by Tang'an Gao; Zeke Wang

Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1993
Tongue
English
Weight
382 KB
Volume
9
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On polynomial complexity of a stochastic
On polynomial complexity of a stochastic algorithm for mixed zero-one programs
✍ Raj Jagannathan πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 236 KB

A stochastic (randomization) algorithm for solving mixed zero-one programs in a yes-no form is presented. Under a set of conditions, we show that any mixed zero-one program is such that either a feasible solution for the problem is obtained or it is classiΓΏed as infeasible. The algorithm is such tha

On the zeros of polynomials
On the zeros of polynomials
✍ A. RΓ©nyi; P. TurΓ‘n πŸ“‚ Article πŸ“… 1952 πŸ› Akadmiai Kiad 🌐 English βš– 329 KB
On the zeros of Jacobi polynomials
On the zeros of Jacobi polynomials
✍ Á. Elbert; A. Laforgia; Lucia G. RodonΓ³ πŸ“‚ Article πŸ“… 1994 πŸ› Akadmiai Kiad 🌐 English βš– 296 KB