✦ LIBER ✦

Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields

✍ Scribed by Grigoriev, Dima Yu.; Karpinski, Marek; Singer, Michael F.

Book ID: 118176846
Publisher: Society for Industrial and Applied Mathematics
Year: 1990
Tongue: English
Weight: 709 KB
Volume: 19
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0219073

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of sparse polynomial inte

The complexity of sparse polynomial interpolation over finite fields

✍ Kai Werther 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 650 KB

Fast parallel algorithm for polynomial i

Fast parallel algorithm for polynomial interpolation

✍ P.K. Jana; B.P. Sinha 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 339 KB

On zero-testing and interpolation of k-s

On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields

✍ Michael Clausen; Andreas Dress; Johannes Grabmeier; Marek Karpinski 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 848 KB

A new algorithm for sparse interpolation

A new algorithm for sparse interpolation of multivariate polynomials

✍ Annie Cuyt; Wen-shin Lee 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 386 KB

Modular Algorithm for Sparse Multivariat

Modular Algorithm for Sparse Multivariate Polynomial Interpolationand its Parallel Implementation

✍ HIROKAZU MURAO; TETSURO FUJISE 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 885 KB

A new algorithm for sparse multivariate polynomial interpolation is presented. It is a multi-modular extension of the Ben-Or and Tiwari algorithm, and is designed to be a practical method to construct symbolic formulas from numeric data produced by vector or massively-parallel processors. The main i

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