𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for polynomial evaluation and interpolation problems

✍ Scribed by Victor Shoup; Roman Smolensky

Publisher
Springer
Year
1996
Tongue
English
Weight
468 KB
Volume
6
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lower bounds and upper bounds for chroma
Lower bounds and upper bounds for chromatic polynomials
✍ Klaus Dohmen πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ Β© 1993 John Wiley & Sons, Inc.

Lower bounds for arithmetic problems
Lower bounds for arithmetic problems
✍ JoΓ£o MeidΓ’nis πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 543 KB
Systolic algorithm for polynomial interp
Systolic algorithm for polynomial interpolation and related problems
✍ H. Schroder; V.K. Murthy; E.V. Krishnamurthy πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 362 KB

This paper describes a systolic algorithm for interpolation and evaluation of polynomials over any field using a linear array of processors. The periods of these algorithms are O(n) for interpolatin and O(1) for evaluation. This algorithm is readily adapted for Chinese remaindering, easily generahze