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

Corrigendum: A Family of Algorithms for Powering Sparse Polynomials

โœ Scribed by Probst, David K.; Alagar, Vangalur S.

Book ID
118173684
Publisher
Society for Industrial and Applied Mathematics
Year
1980
Tongue
English
Weight
32 KB
Volume
9
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A polynomial algorithm for constructing
A polynomial algorithm for constructing families of k-independent sets
โœ G. Freiman; E. Lipkin; L. Levitin ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1003 KB

The present paper describes an algorithm for constructing families of k-independent subsets & of {1,2, . . . , n} with &I >2ck", where c, = d/(k -1)2& and d is a certain constant. The algorithm has a polynomial complexity with respect to the size of the family constructed.

A Family of Sparse Polynomial Systems Ar
A Family of Sparse Polynomial Systems Arising in Chemical Reaction Systems
โœ Karin Gatermann; Birkett Huber ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 511 KB

The positive steady states of chemical reaction systems modeled by mass action kinetics are investigated. This sparse polynomial system is given by a weighted directed graph and a weighted bipartite graph. In this application the number of real positive solutions within certain affine subspaces of R