✦ LIBER ✦

On fast multiplication of polynomials over arbitrary algebras

✍ Scribed by David G. Cantor; Erich Kaltofen

Publisher: Springer-Verlag
Year: 1991
Tongue: English
Weight: 454 KB
Volume: 28
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf01178683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the multiplicity of zeros of polynomi

On the multiplicity of zeros of polynomials over arbitrary finite dimensional K-algebras

✍ F. Leon Pritchard 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 928 KB

On the zeros of polynomials over arbitra

On the zeros of polynomials over arbitrary finite dimensional algebras

✍ Helmut Röhrl 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 963 KB

Fast parallel algorithms for polynomial

Fast parallel algorithms for polynomial division over an arbitrary field of constants

✍ D. Bini; V. Pan 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 817 KB

Orthogonal Sequences of Polynomials over

Orthogonal Sequences of Polynomials over Arbitrary Fields

✍ Simon R. Blackburn 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 325 KB

Let f and g be polynomials over some field, thought of as elements of the ring of one-sided Laurent series, and suppose that deg f<deg g. The quotient fÂg is badly approximable if all the partial quotients of the continued fraction expansion of fÂg have degree 1. We investigate the set of polynomial

Fast Multiplication on Elliptic Curves o

Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two

✍ Volker Müller 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 163 KB

On the Multiplication of Schubert Polyno

On the Multiplication of Schubert Polynomials

✍ Rudolf Winkel 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Finding a combinatorial rule for the multiplication of Schubert polynomials is a long standing problem. In this paper we give a combinatorial proof of the extended Pieri rule as conjectured by N. Bergeron and S. Billey, which says how to multiply a Schubert polynomial by a complete or elementary sym